Sunday, November 17, 2024
Sponsors

Tag: C language

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

C/C++
#include <limits.h> #include <stdio.h> #define N 1000 void query(int *ww, int *aa, int...
Read more

Codeforces Round #384 (Div....

C/C++
#include <stdio.h> #include <string.h> #define MAX(X,Y) ((X)>(Y) ? (X) : (Y)) #define...
Read more

Codeforces Round #384 (Div....

C/C++
#include<stdio.h> int main(){ long x; scanf("%ld",&x); if(x==1) printf("-1"); else printf("%ld %ld %ld",x,x+1,x*(x+1)); return 0; }
Read more

Codeforces Round #384 (Div....

C/C++
long long k; main() { scanf("%d%lld",&k,&k); printf("%dn",1+__builtin_ctzll(k)); }
Read more

Codeforces Round #384 (Div....

C/C++
#include<stdio.h> int main() { int i,j,n,a,b; char s; scanf("%d%d%d",&n,&a,&b); scanf("%s",s); if(s==s) { printf("0"); } else printf("1"); return 0; }
Read more

Codeforces Round #383 (Div....

C/C++
#include <bits/stdc++.h> using namespace std; #define fo(i,a,b) for(int i=(a);i<(b);i++) #define MOD 1000000007 #define...
Read more

Codeforces Round #383 (Div....

C/C++
#include<stdio.h> int n, m, maxW, p, w, b, prev, next,...
Read more

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

Advertisement

spot_img

EDITOR PICKS

POPULAR POSTS

POPULAR CATEGORY

© E-Blogarithm 2016