Tag: Codeforces Round #378 (Div. 2)

C/C++

Codeforces Round #378 (Div. 2), problem: (E) Sleep in Class Solution in C

#include #define ABS(a) ((a) < 0 ? (a) : (a)) #define MIN(a, b) ((a) (b) ? (a)...
Admin -
Read
C/C++

Codeforces Round #378 (Div. 2), problem: (D) Kostya the Sculptor Solution In C

#include #include #define N 100000 #define M 1000000007 #define MIN(A, B) ((A) next) if (x->a == a && x->b == b) return x; return...
Admin -
Read
C/C++

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

Hi guys , i just tried the Epidemic in Monstropolis problem , hope you might like it...
Admin -
Read
C/C++

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

Hey Guys I just tried the Parade solution , hope you like it , comment if you...
Admin -
Read
C/C++

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

Hi guys , i just tried the Grasshopper problem , hope you might like it . #include int main(){ char...
Admin -
Read

Want to stay up to date with the latest news?

We would love to hear from you! Please fill in your details and we will stay in touch. It's that simple!