|
3736 |
codeforces#P778B Bitwise Formula
|
0 / 0 |
6 |
|
3734 |
codeforces#P778C Peterson Polyglot
|
0 / 0 |
9 |
|
3726 |
codeforces#P780C Andryusha and Colored Balloons
|
0 / 0 |
5 |
|
3724 |
codeforces#P780E Underground Lab
|
0 / 0 |
7 |
|
3708 |
codeforces#P786A Berzerk
|
0 / 0 |
7 |
|
3705 |
codeforces#P786D Rap God
|
0 / 0 |
10 |
|
3700 |
codeforces#P788B Weird journey
|
0 / 0 |
7 |
|
3699 |
codeforces#P788C The Great Mixing
|
0 / 0 |
8 |
|
3686 |
codeforces#P793B Igor and his way to work
|
0 / 0 |
5 |
|
3683 |
codeforces#P793E Problem of offices
|
0 / 0 |
10 |
|
3676 |
codeforces#P794D Labelling Cities
|
0 / 0 |
9 |
|
3670 |
codeforces#P796D Police Stations
|
0 / 0 |
7 |
|
3663 |
codeforces#P797D Broken BST
|
0 / 0 |
7 |
|
3638 |
codeforces#P802J Send the Fool Further! (easy)
|
0 / 0 |
4 |
|
3636 |
codeforces#P802L Send the Fool Further! (hard)
|
0 / 0 |
9 |
|
3623 |
codeforces#P804C Ice cream coloring
|
0 / 0 |
8 |
|
3622 |
codeforces#P804D Expected diameter of a tree
|
0 / 0 |
9 |
|
3620 |
codeforces#P804F Fake bullions
|
0 / 0 |
10 |
|
3598 |
codeforces#P811D Vladik and Favorite Game
|
0 / 0 |
7 |
|
3592 |
codeforces#P812D Sagheer and Kindergarten
|
0 / 0 |
10 |
|
3588 |
codeforces#P813C The Tag Game
|
0 / 0 |
5 |
|
3581 |
codeforces#P814D An overnight dance in discotheque
|
0 / 0 |
7 |
|
3549 |
codeforces#P821D Okabe and City
|
0 / 0 |
8 |
|
3542 |
codeforces#P822F Madness
|
0 / 0 |
9 |
|
3537 |
codeforces#P825E Minimal Labels
|
0 / 0 |
8 |
|
3536 |
codeforces#P825G Tree Queries
|
0 / 0 |
9 |
|
3531 |
codeforces#P827D Best Edge Weight
|
1 / 3 |
10 |
|
3515 |
codeforces#P832D Misha, Grisha and Underground
|
0 / 0 |
6 |
|
3501 |
codeforces#P835F Roads in the Kingdom
|
0 / 1 |
9 |
|
3492 |
codeforces#P838B Diverging Directions
|
0 / 0 |
7 |
|
3485 |
codeforces#P839C Journey
|
0 / 0 |
5 |
|
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 |
|
3470 |
codeforces#P843A Sorting by Subsequences
|
0 / 0 |
4 |
|
3468 |
codeforces#P843C Upgrading Tree
|
0 / 0 |
10 |
|
3457 |
codeforces#P845G Shortest Path Problem?
|
0 / 0 |
8 |
|
3452 |
codeforces#P846E Chemistry in Berland
|
0 / 0 |
8 |
|
3442 |
codeforces#P847I Noise Level
|
0 / 0 |
6 |
|
3439 |
codeforces#P847L Berland SU Computer Network
|
0 / 0 |
9 |
|
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 |
|
3380 |
codeforces#P860E Arkady and a Nobody-men
|
0 / 0 |
10 |
|
3378 |
codeforces#P862B Mahmoud and Ehab and the bipartiteness
|
2 / 14 |
4 |
|
3361 |
codeforces#P864F Cities Excursions
|
1 / 1 |
10 |
|
3342 |
codeforces#P869D The Overdosing Ubiquity
|
0 / 0 |
10 |
|
3336 |
codeforces#P870E Points, Lines and Ready-made Titles
|
1 / 5 |
8 |
|
3325 |
codeforces#P875C National Property
|
0 / 0 |
7 |