Комментарии
На chrome → Topcoder Single Round Match 677, 11 лет назад
+38

На superior → Sleep Amount :3, 11 лет назад
+19

Problem is here:

If you don't sleep enough time, your brain won't work very good.

But if you will sleep, you will have less time for studying.

Can anyone say something about that?

На Xellos → Codeforces Round #333, 11 лет назад
0

In this round fest and Shadow are cheaters.

Here are their solutions for B:

14455597

14455707

На m.ajaj94 → A better way for practicing, 11 лет назад
+1

I think it doesn't matter from which problem you start.

P.S. There are a lot of blogs like yours, read them and try to find your problem.

Say it to red coders who became orange after color revolution.

На romanasa → Codeforces Round #329 (Div. 2), 11 лет назад
+62

I'm so sorry, it seems like no one enjoys this problems...

На romanasa → Codeforces Round #329 (Div. 2), 11 лет назад
-14

gl & hf!

На EasyCoding → Need help..., 12 лет назад
+6

Thanks for help!

На EasyCoding → Need help..., 12 лет назад
+3

Here is statement :

Given n, and array A(all numbers less than 10^9).

Then given m, and m requests :

1) + l r d, add to all numbers from l to r d (1 <= l <= r <= n, 0 <= d <= 10^9).

2) * l r d, multiply to all numbers from l to r d (1 <= l <= r <= n, 0 <= d <= 10^9).

3) ? p, print p-th number modulo 10^9 + 7.

P.S This problem from Republic olympiad in Kazakhstan.

На GiveMinus → fastest, 12 лет назад
+6

I see your speed of coding in your last contest, very good job!