#include <iostream> #include <stack> #include <cmath> #include <string.h> #include <algorithm> #include <stack> #include <vector>...

#include  <iostream> #include  <vector> int   main (){ long   long  N; std :: cin  >>  N; std :: vector < long   long >  mins (N  +  ...

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

#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 <string> using namespace std; int main(){ string whole; cin >> whole; int L = 0; int M = 0; int S = 0;...

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

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....

https://www.cemc.uwaterloo.ca/contests/computing/2020/ccc/seniorEF.pdf The problem can be solved only by c++. The key thing is the...

https://www.cemc.uwaterloo.ca/contests/computing/2016/stage%201/seniorEn.pdf Solution 1: recursive that is based on DP solution, please...

https://www.cemc.uwaterloo.ca/contests/computing/2000/stage1/2000CCCStage1Contest.pdf Solution: Build a map to store each page URL...

The boundaries of a neighbourhood are defined by the two adjacent villages. 1. Sort the villages,. 2. Compute the midpoint of each...

Matrix rotated anti clockwise 90 degree, next 90 degree (180 degree), next 90 degress(270 degree), next 90 degree(360 degree). Look the...

For this problem, we can use a simple for-loop to generate values of a and b.Set a=i and b=2n−i. Loop it through the integers from 2 to...