Saturday, December 21, 2024
Sponsors

Tag: Codeforces Round #382 (Div. 1)

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

Uncategorized
#include <stdio.h> #include <string.h> #include <stdlib.h> #define M 1000000007 int add(int a, int b)...
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

Advertisement

spot_img

EDITOR PICKS

POPULAR POSTS

POPULAR CATEGORY

© E-Blogarithm 2016