| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3657 |
| 3 | jiangly | 3638 |
| 4 | turmax | 3442 |
| 5 | tourist | 3380 |
| 6 | Um_nik | 3353 |
| 7 | strapple | 3350 |
| 8 | squareOf105 | 3346 |
| 9 | heuristica | 3322 |
| 10 | maroonrk | 3310 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 151 |
| 3 | maspy | 150 |
| 4 | AmShZ | 144 |
| 4 | Um_nik | 144 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 135 |
| 9 | maroonrk | 133 |
| 10 | Proof_by_QED | 130 |
|
+38
|
|
+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? |
|
0
|
|
+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. |
|
+6
Say it to red coders who became orange after color revolution. |
|
+62
I'm so sorry, it seems like no one enjoys this problems... |
|
-14
gl & hf! |
|
+6
Thanks for help! |
|
+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. |
|
I see your speed of coding in your last contest, very good job!
|
| Name |
|---|


