Tag: Codeforces Round #415 (Div. 2)

Java

Codeforces Round #415 (Div. 2), problem: (E) Find a car Solution In JAVA

import java.util.*; public class C{ final int MOD = (int)1e9 + 7; long get(int x, int y, int lim){ if (Math.min(x,y)...
Admin -
Read
C/C++

Codeforces Round #415 (Div. 2), problem: (D) Glad to see you! Solution In C/C++

#include <cstdio> using namespace std; #define ff fflush(stdout) #define mid (lef+rig>>1) int n, k, x, t1, t2; char s; inline bool I(int...
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!