Solution in C++ Archive

#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; …

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; …

The Shining-Part3 Assume, in \The Shining-Part3″, the son makes it even worse by reversing the words in a sentence in place but leaving the punctuations as they are. For example, the son writes \NUR, REHTOM! …

Hi guys , I just solved the Codeforces Round #377 (Div. 2), problem: (C) Sanatorium , hope you like it . You are most welcome to submit any other solution . #include using namespace std; …

Hi guys , I just solved the Codeforces Round #377 (Div. 2), problem: (B) Cormen — The Best Friend Of a Man, hope you like it . You are most welcome to submit any other …