| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3390 |
| 6 | Um_nik | 3387 |
| 7 | tourist | 3384 |
| 8 | heuristica | 3322 |
| 9 | turmax | 3319 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 143 |
| 5 | AmShZ | 142 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | maroonrk | 133 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
|
+68
There are no memes in the comment section? spits coffee
|
|
+108
"After the exam Polycarp can justify his rule violations by telling the driving instructor that he just didn't notice some of the signs."
Unfunny meme amirite |
|
+14
Loop is an edge similar to (u, u). Cycles are not allowed. Cycles are allowed. Not like this. Not like this... |
|
+3
Man, shit, complete, after I save Russia, ask for the text, translate and translate the text "from them." Well I think the best method of reading grammatically incorrect sentences is to translate to Russian and then back, I guess. |
|
+23
Okay, this is getting ridiculous. This is what I get when I translate from English to Russian to English. Lech plays a computer game where at each level a connected graph with n vertices and m edges is given. Graph can contain multiple edges, but can not contain loops. Each vertex has an integer di, which can be 0, 1, or -1. To pass a level, it needs to find a "good" subset of the edges of the graph or say that it does not exist. A subset is called "good". If we save only edges from the subset on the graph and correct for each vertex i, that di = -1 or the degree modulo 2 is equal to di. Lech wants to pass the game as soon as possible and ask you to help him. At least that's understandable. |
|
+14
As if we could "save in a graph only edges" from a subset... Really, how old are the proofreaders? Freaking 5? |
|
+15
Well, he's in second. So... |
|
-10
Sure. I'll wait. |
|
-7
Yeah, but that doesn't mean he's an idiot. He could have a comeback when he solves D or E. |
|
-7
You sure? |
|
+9
tourist is solving D I guess. |
|
+15
Way too many times. |
|
-105
Yes, but jesus. Let me rest for a bit. |
|
-174
Damnit codeforces, two consecutive rounds is too much. |
|
0
I was learning about Fluorine. On the same day, I made a Clash of Clans account. So LegendaryTooth was born. That name has stuck to me ever since. |
| Name |
|---|


