Codeforces Round #426 (Div. 1) Archive

#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 (a.second == id) { a.first = …

#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, ll b) { if(!b) return 1; ll ns = …