Tag: Codeforces Round #382 (Div. 2)

#include <stdio.h> #include <string.h> #include <stdlib.h> #define M 1000000007 int add(int a, int b) { return (a + b) % M; } int...

#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 0; } } return 1; } 📦 Looking for Codeforces Round 382 Div...

#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++; a=b; b=k; k=a+b; } printf("%I64d",c); } 📦 Looking for...

#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 t=n1; n1=n2; n2=t; } double count1=0,count2=0; for(int i=0;i<n1;i++) { count1+=1.0*w; } for(int i=n1;i<n1+n2;i++) { count2+=1.0*w; } printf("%.8lfn",count1/n1+count2/n2); return 0; } 📦 Looking for...

#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"); } 📦 Looking for Codeforces Round 382 Div Problem Ostap? Check the best...