#include<iostream> #include <vector> #include <algorithm> #include <cmath> #include <stack> using namespace std; int main() { int r, c,...

s1 = input() s2 = input() silly = '' silly_o = '' quiete = '-' i = 0 j = 0 while i < len(s1) and j < len(s2): if s1[i] != s2[j]: if...

#include<iostream> #include <vector> #include <algorithm> #include <cmath> using namespace std; bool rowcom(pair<int, int> a, pair<int,...

#include <iostream> #include <string> #include <map> #include <vector> #include <algorithm> #include <cmath> using namespace std; char...

#include <iostream> #include <string> #include <map> #include <set> #include <map> using namespace std; int main(){ int n; cin >> n;...

#include <iostream> #include <vector> #include <stack> #include <queue> #include <set> using namespace std; int main() { int N; cin >>...

#include <iostream> #include <vector> #include <stack> #include <queue> #include <set> using namespace std; //index 0 ===>rule string...

This is a graph level traversal problem. Start with the first char of seed string, go to 8 directions for next char. when you try to go...

# include <iostream> # include <vector> using namespace std; void rotateAclockwise90Vector(vector < vector < int >> & A, int N) { if (N...

#include <iostream> #include <string> using namespace std; int main(){ string whole; cin >> whole; int L = 0; int M = 0; int S = 0;...

A = 0 B = 0 m = {'A': A, 'B': B} while True: cmds = input().split(" ") if cmds[0] == '1': m[cmds[1]] = int(cmds[2]) elif cmds[0] ==...

Please read the problem description: https://www.cemc.uwaterloo.ca/contests/computing/2021/ccc/seniorEF.pdf The problem is BFS question....

https://cemc.uwaterloo.ca/contests/computing/2021/ccc/juniorEF.pdf The problem is math problems. Assume, L is the number of char L, M is...

This is a binary search problem. Implement the algrithom: Compute mid-1, mid, mid+1, if P(mid-1)< P(mid)< p(mid+1), the result will be...

https://cemc.uwaterloo.ca/contests/computing/2021/ccc/juniorEF.pdf Data structure: bool grid[m+1][n+1] , B is false, G is true bool ...

This is a dynamic programming question. Suppose f(i, j) express if it can be combined from the ith rice ball to the jth rice ball....

DP problems. They choose the coach’s burger. In this case, no further disruptions are caused and Josh gets his burger. They choose Josh’s...

The fox start from (0,0) that is the starting point, it has no treat. Then the fox can visit from every point of N to every other point...

Use a dictionary to store members of each other. if can not find a pair, print "bad, otherwise print "good". N = int(input()) name1 =...

This is a math question. The original list is from 1 to N. Then remove elements that are multiple cn_i from the list. N = int(input())...