Codeforces Round #393 (Div. 2) Archive

#include <bits/stdc++.h> using namespace std; const int mod = 1e9+7; long long t; long long binpow(long long a, long long n){ long long ans = 1; while(n){ if(n&1) ans = ans*a % mod; a = …

#include <bits/stdc++.h> using namespace std; const int maxn = 1e5; int a; struct segtree{ int lb, rb; int mx = 0, d = 0; segtree *l, *r; segtree(int _lb, int _rb){ lb = _lb, rb …

#include <stdio.h> #define SIZE 100010 struct ride { int cost, t; } r; int main() { int i, j, n; scanf(“%d”, &n); r.t = r.cost = 0; for (i = 1; i <= n; i++) …

#include <stdio.h> #define N 200000 int pp, used; void dfs(int i) { if (used) return; used = 1; dfs(pp); } int main() { int n, i, sum, cnt; static int bb; scanf(“%d”, &n); for (i …

#include <stdio.h> int main() { int n, m, k, h, l, r; scanf(“%d %d %d”, &n, &m, &k); l = r = k; h = 1; m -= n; while (m – (r – l …

#include<stdio.h> int main() { int a={31,28,31,30,31,30,31,31,30,31,30,31}; int i,m,d,k,n,p; scanf(“%d %d”,&m,&d); k=7-d+1; i=m-1; n=a-k; p=n/7; if(p*7!=n) p++; printf(“%d”,p+1); }