| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 154 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 146 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 133 |
| 10 | cry | 130 |
|
0
Maybe it isn't a good idea, but i can't see editorial for this problems :( Screenshot
|
|
0
As I understood, and as I finally get "Full solution": For exmaple, we have (Answer 20) We should take different variants of pieces: And for each variant, we calculate sum and compare with the minimum: if (min < sum-(360-sum)) min = sum-(360-sum) Tried to explain my solution on my bad english :D |
|
0
Ahhh, I see. Thanks :) |
|
0
Test 8 picture
|
|
0
Can anyone explain, why in Problem A on the test 8: The answer is 40? We can take 90 40 50 and 110 70 — 180 and 180, so the answer is 0, isn't it? Or did I misunderstand it? |
|
+6
Same code. Same compilator. Differnet verdicts. http://codeforces.me/contest/753/submission/23942304 http://codeforces.me/contest/753/submission/23942242 One question. HOW?:) |
|
+18
|
|
-13
I can solve only first problem for 2 hours and i'm green, so you need to solve only first problem and you become green:) |
| Name |
|---|


