Codeforces Round #378 (Div. 2)

/Tag: Codeforces Round #378 (Div. 2)

Codeforces Round #378 (Div. 2), Problem: (C) Epidemic in Monstropolis Solution in C

By |2017-04-07T22:11:50+06:00November 1st, 2016|Categories: C/C++, Programming||

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

CodeForces Round #378 (Div. 2), problem: (B) Parade Solution In C

By |2017-04-07T22:11:50+06:00November 1st, 2016|Categories: C/C++, Programming||

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[100000][2],k=0;long int s=0,x,l=0,r=0; scanf("%d",&n); for(i=0;i

Codeforces Round #378 (Div. 2), Problem: (A) Grasshopper And the String Solution in C

By |2017-04-07T22:11:51+06:00October 31st, 2016|Categories: C/C++, Programming||

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