Tag: Codeforces Round #426 (Div. 1)

C/C++

Codeforces Round #426 (Div. 1), problem: (E) Caramel Clouds Solution In C/C++

#include <algorithm> #include <cstdio> #include <cstring> #include <map> #include <set> #include <utility> #include <vector> const int N = 300000; struct Sum { int add(int id, int value) { if...
Admin -
Read
C/C++

Codeforces Round #426 (Div. 1), problem: (D) Red-Black Cobweb Solution In C/C++

#include <iostream> #include <cstring> #include <cstdio> #include <cmath> #include <algorithm> #define maxn 100005 #define mod 1000000007 #define ll long long using namespace std; ll ksm(ll a,...
Admin -
Read

Want to stay up to date with the latest news?

We would love to hear from you! Please fill in your details and we will stay in touch. It's that simple!