|
3522 |
codeforces#P830E Perpetual Motion Machine
|
0 / 0 |
10 |
|
3515 |
codeforces#P832D Misha, Grisha and Underground
|
0 / 0 |
6 |
|
3501 |
codeforces#P835F Roads in the Kingdom
|
0 / 1 |
9 |
|
3485 |
codeforces#P839C Journey
|
0 / 0 |
5 |
|
3483 |
codeforces#P839E Mother of Dragons
|
0 / 1 |
10 |
|
3481 |
codeforces#P840B Leha and another game about graph
|
0 / 0 |
7 |
|
3473 |
codeforces#P842C Ilya And The Tree
|
0 / 0 |
7 |
|
3471 |
codeforces#P842E Nikita and game
|
0 / 0 |
10 |
|
3468 |
codeforces#P843C Upgrading Tree
|
0 / 0 |
10 |
|
3467 |
codeforces#P843D Dynamic Shortest Path
|
0 / 0 |
10 |
|
3466 |
codeforces#P843E Maximum Flow
|
0 / 0 |
10 |
|
3457 |
codeforces#P845G Shortest Path Problem?
|
0 / 0 |
8 |
|
3441 |
codeforces#P847J Students Initiation
|
0 / 0 |
9 |
|
3439 |
codeforces#P847L Berland SU Computer Network
|
0 / 0 |
9 |
|
3434 |
codeforces#P848D Shake It!
|
0 / 0 |
10 |
|
3427 |
codeforces#P850D Tournament Construction
|
0 / 0 |
10 |
|
3414 |
codeforces#P852I Dating
|
0 / 0 |
8 |
|
3400 |
codeforces#P855G Harry Vs Voldemort
|
0 / 0 |
10 |
|
3388 |
codeforces#P858F Wizard's Tour
|
0 / 0 |
8 |
|
3383 |
codeforces#P859E Desk Disorder
|
0 / 0 |
7 |
|
3378 |
codeforces#P862B Mahmoud and Ehab and the bipartiteness
|
2 / 14 |
4 |
|
3371 |
codeforces#P863C 1-2-3
|
0 / 0 |
6 |
|
3361 |
codeforces#P864F Cities Excursions
|
1 / 1 |
10 |
|
3356 |
codeforces#P865E Hex Dyslexia
|
1 / 2 |
10 |
|
3348 |
codeforces#P868E Policeman and a Tree
|
1 / 1 |
10 |
|
3342 |
codeforces#P869D The Overdosing Ubiquity
|
0 / 0 |
10 |
|
3336 |
codeforces#P870E Points, Lines and Ready-made Titles
|
0 / 0 |
8 |
|
3334 |
codeforces#P871E Restore the Tree
|
0 / 0 |
10 |
|
3325 |
codeforces#P875C National Property
|
0 / 0 |
7 |
|
3322 |
codeforces#P875F Royal Questions
|
0 / 0 |
9 |
|
3316 |
codeforces#P877D Olya and Energy Drinks
|
0 / 0 |
7 |
|
3311 |
codeforces#P878C Tournament
|
0 / 0 |
10 |
|
3305 |
codeforces#P883B Berland Army
|
0 / 0 |
10 |
|
3300 |
codeforces#P883G Orientation of Edges
|
0 / 0 |
6 |
|
3288 |
codeforces#P884F Anti-Palindromize
|
0 / 0 |
9 |
|
3284 |
codeforces#P886D Restoration of string
|
0 / 0 |
7 |
|
3270 |
codeforces#P888F Connecting Vertices
|
0 / 0 |
9 |
|
3265 |
codeforces#P891C Envy
|
0 / 0 |
8 |
|
3258 |
codeforces#P893C Rumor
|
0 / 0 |
4 |
|
3250 |
codeforces#P894E Ralph and Mushrooms
|
1 / 1 |
7 |
|
3229 |
codeforces#P899C Dividing the numbers
|
0 / 0 |
4 |
|
3218 |
codeforces#P901C Bipartite Segments
|
0 / 0 |
8 |
|
3217 |
codeforces#P901D Weighting a Tree
|
0 / 0 |
10 |
|
3207 |
codeforces#P903G Yet Another Maxflow Problem
|
0 / 0 |
10 |
|
3204 |
codeforces#P906C Party
|
0 / 0 |
9 |
|
3194 |
codeforces#P908F New Year and Rainbow Roads
|
0 / 0 |
9 |
|
3187 |
codeforces#P909E Coprocessor
|
0 / 0 |
6 |
|
3177 |
codeforces#P911F Tree Destruction
|
0 / 0 |
9 |
|
3172 |
codeforces#P912D Fishes
|
0 / 0 |
7 |
|
3165 |
codeforces#P913F Strongly Connected Tournament
|
0 / 0 |
10 |