Saturday, November 16, 2024
Sponsors

Tag: CodeForces

Codeforces Solution, Codeforces.com solution,codeforces div 1 solution, codeforces division 1 solution,codeforces div 2 solution, codeforces division 2 solution,Codeforces problem,codeforcesproblem solution,codeforces regular problem solution,codeforces regular,c programming sample programms, c programming examples,c++ regular programms, c++ programming examples,programmng language , basic programming,easy programming example,easy programming solutions,C language, c language solutions, c language examples,Codeforces solve, Codeforces.com solve,codeforces div 1 solve, codeforces division 1 solve,codeforces div 2 solve, codeforces division 2 solve,Codeforces problem,codeforcesproblem solve,codeforces regular problem solve,codeforces regular,c programming sample programms, c programming examples,c++ regular programms, c++ programming examples,programmng language , basic programming,easy programming example,easy programming solves,C language, c language solves, c language examples,

Codeforces Round #407 (Div....

C/C++
#include<bits/stdc++.h> using namespace std; int n,k,f; bitset<2001> dp; int main() { cin>>n>>k; for(int i=1,t;i<=k;i++) { scanf("%d",&t); f=1; } dp=1; int now=0; for(int i=1;i<=1000;i++) { now^=1; dp.reset(); for(int...
Read more

Codeforces Round #407 (Div....

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

Codeforces Round #407 (Div....

C/C++
#include <iostream> #include <map> using namespace std; map<long long, int> was; map<long long,...
Read more

Codeforces Round #393 (Div....

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

Codeforces Round #393 (Div....

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

Codeforces Round #393 (Div....

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

Codeforces Round #393 (Div....

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

Codeforces Round #393 (Div....

C/C++
#include <stdio.h> int main() { int n, m, k, h, l, r; scanf("%d...
Read more

Codeforces Round #393 (Div....

C/C++
#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); }
Read more

Codeforces Round #392 (Div....

C/C++
#include<stdio.h> #include<stdlib.h> #define N 10000001 #define SN 3163 typedef long long unsigned llu; typedef...
Read more

Codeforces Round #392 (Div....

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

Codeforces Round #392 (Div....

C/C++
#include <stdio.h> #include <string.h> int main() { static char s; static long long...
Read more

Advertisement

spot_img

EDITOR PICKS

POPULAR POSTS

POPULAR CATEGORY

© E-Blogarithm 2016