Codeforces Round #378 (Div. 2) Archive

#include #define ABS(a) ((a) < 0 ? (a) : (a)) #define MIN(a, b) ((a) < (b) ? (a) : (b)) #define MAX(a, b) ((a) > (b) ? (a) : (b)) #define TRUE 1 #define FALSE …

#include #include #define N 100000 #define M 1000000007 #define MIN(A, B) ((A) < (B) ? (A) : (B)) int i1, i2, k; double max; struct item { int i, a, b, c; struct item *next; …

Hi guys , i just tried the Epidemic in Monstropolis problem , hope you might like it . #include #include #define MAXN 500 int a; int b; int partial_sums; unsigned char d; unsigned char equals; …

Hey Guys I just tried the Parade solution , hope you like it , comment if you have any better code . #include int main(){ int n,i,a,k=0;long int s=0,x,l=0,r=0; scanf(“%d”,&n); for(i=0;i

Hi guys , i just tried the Grasshopper problem , hope you might like it . #include int main(){ char a;int k=-1,i,max=0,s; scanf(“%s”,a); for(i=0;a!=’\0′;i++) { if(a==’A’||a==’E’||a==’I’||a==’O’||a==’U’||a==’Y’) {s=i-k;k=i; if(s>max) max=s;} }s=i-k; if(s>max) max=s; printf(“%d”,max); return 0; …