Sponsors

Tag: C Programming

Codeforces Round #407 (Div....

#include<bits/stdc++.h> #define ll long long using namespace std; ll in; vector<int>adj; ll ans=0; bool g; int...

Codeforces Round #407 (Div....

#include <iostream> #include <map> using namespace std; map<long long, int> was; map<long long,...

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

Codeforces Round #393 (Div....

#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); }

Codeforces Round #392 (Div....

#include<stdio.h> #include<stdlib.h> #define N 10000001 #define SN 3163 typedef long long unsigned llu; typedef...

Codeforces Round #392 (Div....

#include <bits/stdc++.h> #define mk make_pair using namespace std; typedef long long ll; const...

Codeforces Round #392 (Div....

#include <stdio.h> #include <string.h> int main() { static char s; static long long...

Codeforces Round #392 (Div....

#include <stdio.h> int n,m,X,Y; long long K; long long ans; int main() { int i,j,t; long...

Advertisement

spot_img