Sunday, November 17, 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,

odeforces Round #383 (Div....

C/C++
#include<stdio.h> int n, c, v; int gcd(long long a, long long...
Read more

Codeforces Round #383 (Div....

C/C++
#include<stdio.h> int v; int main(){ int i,l,n,x; long long int r; scanf("%d%d",&n,&x); for(i=0;i<n;i++) { scanf("%d",&l); r=r+v; v++; } printf("%I64d",r); return 0; }
Read more

Codeforces Round #382 (Div....

C/C++
#include<iostream> #include<cstdio> #include<algorithm> #define N 3010 using namespace std; int n,m,f; struct ma{int x,y;}a; bool operator<(ma...
Read more

Codeforces Round #382 (Div....

C/C++
#include <bits/stdc++.h> using namespace std; const int N=2e3+1; int n,m,x,y; bitset<N*2> a; int...
Read more

Codeforces Round #382 (Div....

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

Codeforces Round #382 (Div....

C/C++
#include<stdio.h> main() { long long int n,i,j,c=0,a,b,k; scanf("%I64d",&n); a=1; b=1; k=a+b; while(k<=n) { c++; ...
Read more

Codeforces Round #382 (Div....

C/C++
#include<stdio.h> #include<stdlib.h> int cmp(const void*a,const void*b) { return *(int*)b-*(int*)a; } int w; int main() { int n,n1,n2; scanf("%d%d%d",&n,&n1,&n2); for(int i=0;i<n;i++) scanf("%d",&w); qsort(w,n,sizeof(w),cmp); if(n1>n2) { int...
Read more

Codeforces Round #382 (Div....

C/C++
  #include<stdio.h> int b,d; int main(){ int i,s,n,k,t; scanf("%d%d",&n,&k); char x; for(i=1;i<=n;i++){ scanf(" %c",&x); if(x=='G')s=i; if(x=='T')t=i; if(x=='#')b=1; } for(i=s;i<=n;i+=k){ if(b) break; d=1; } for(i=s;i>=1;i-=k){ if(b) break; d=1; } if(d) printf("YES"); else printf("NO"); }
Read more

Codeforces Round #381 (Div....

C/C++
Hi guys , I just solved the fifth problem...
Read more

Codeforces Round #381 (Div....

C/C++
Hi guys , I just solved the third problem...
Read more

Codeforces Round #381 (Div....

C/C++
Hi guys , I just solved the second problem...
Read more

Codeforces Round #381 (Div....

C/C++
Hi guys , I just solved the first problem...
Read more

Advertisement

spot_img

EDITOR PICKS

POPULAR POSTS

POPULAR CATEGORY

© E-Blogarithm 2016