Saturday, November 16, 2024
Sponsors

Tag: Codeforces.com

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 #411 (Div....

C/C++
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.StringTokenizer; public class...
Read more

Codeforces Round #411 (Div....

C/C++
#include <stdio.h> int n; int main() { scanf("%d",&n); if(n%4>1)return printf("NOn"),0; printf("YESn"); for(int i=1;i<n;i+=4) { if(n%4)printf("%d %dn%d %dn%d %dn",i+2,n,i+2,i+3,i+3,n); else...
Read more

Codeforces Round #411 (Div....

C/C++
#include <set> #include <vector> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int...
Read more

Codeforces Round #411 (Div....

C/C++
#include<iostream> main(){int n;std::cin>>n;std::cout<<(n-1)/2;}
Read more

Codeforces Round #411 (Div....

Uncategorized
#include <cstdio> int n; int main (){ scanf("%d", &n); for (int i =...
Read more

Codeforces Round #411 (Div....

C/C++
#include <iostream> int l,r; int main() { std::cin>>l>>r; std::cout<<(l==r ? l:2); return 0; }
Read more

Codeforces Round #410 (Div....

C/C++
#pragma warning(disable:4996) #include <stdio.h> #include <iostream> #include <iomanip> #include <vector> #include <algorithm> #include <string.h> #include <stdlib.h> #include...
Read more

Codeforces Round #410 (Div....

C/C++
#include<bits/stdc++.h> using namespace std; const int maxn=100000+10; int b,n,flag=1,dp; struct node { int id,x; }a; int cmp(node...
Read more

Codeforces Round #410 (Div....

Uncategorized
#include <bits/stdc++.h> using namespace std; string s; int main() { int n, t, ans; ans...
Read more

Codeforces Round #409 (rated,...

C/C++
#include<cstdio> #include<cstring> #include<algorithm> #include<cctype> #include<ctime> #include<cstdlib> #include<string> #include<queue> #include<cmath> #include<set> #include<map> #include<bitset> #include<vector> #define rep(x,a,b) for (int x=int(a);x<=(int)(b);x++) #define drp(x,a,b) for (int x=int(a);x>=(int)(b);x--) #define...
Read more

Codeforces Round #409 (rated,...

C/C++
#include <bits/stdc++.h> #define MAXN (1000000) #define MAXM (6) #define mod (1000000007) #define ll...
Read more

Codeforces Round #409 (rated,...

C/C++
#include<cstdio> #include<cstdlib> #include<cmath> #include<algorithm> #include<cstring> using namespace std; #define maxn 1005 int x,y; int n; long long area(int...
Read more

Advertisement

spot_img

EDITOR PICKS

POPULAR POSTS

POPULAR CATEGORY

© E-Blogarithm 2016