Tag: Codeforces Round #393 (Div. 2)

Codeforces Round #393 (Div....

#include <bits/stdc++.h> using namespace std; const int mod = 1e9+7; long long...

Codeforces Round #393 (Div....

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5; int a; struct...

Codeforces Round #393 (Div....

#include <stdio.h> #define SIZE 100010 struct ride { int cost, t; } r; int...

Codeforces Round #393 (Div....

#include <stdio.h> #define N 200000 int pp, used; void dfs(int i) { if...

Codeforces Round #393 (Div....

#include <stdio.h> int main() { int n, m, k, h, l, r; scanf(“%d...

Advertisement

spot_img