|
6330 |
P780E Underground Lab
|
0 / 0 |
7 |
|
6314 |
P786A Berzerk
|
0 / 0 |
7 |
|
6311 |
P786D Rap God
|
0 / 0 |
10 |
|
6306 |
P788B Weird journey
|
0 / 0 |
7 |
|
6305 |
P788C The Great Mixing
|
0 / 0 |
8 |
|
6292 |
P793B Igor and his way to work
|
0 / 0 |
5 |
|
6289 |
P793E Problem of offices
|
0 / 0 |
10 |
|
6283 |
P794D Labelling Cities
|
0 / 0 |
9 |
|
6276 |
P796D Police Stations
|
0 / 0 |
7 |
|
6270 |
P797D Broken BST
|
0 / 0 |
7 |
|
6244 |
P802J Send the Fool Further! (easy)
|
0 / 0 |
4 |
|
6242 |
P802L Send the Fool Further! (hard)
|
0 / 0 |
9 |
|
6229 |
P804C Ice cream coloring
|
0 / 0 |
8 |
|
6228 |
P804D Expected diameter of a tree
|
0 / 0 |
9 |
|
6226 |
P804F Fake bullions
|
0 / 0 |
10 |
|
6200 |
P811D Vladik and Favorite Game
|
0 / 0 |
7 |
|
6189 |
P812D Sagheer and Kindergarten
|
0 / 0 |
10 |
|
6182 |
P813C The Tag Game
|
0 / 0 |
5 |
|
6167 |
P814D An overnight dance in discotheque
|
0 / 0 |
7 |
|
6104 |
P821D Okabe and City
|
0 / 0 |
8 |
|
6089 |
P822F Madness
|
0 / 0 |
9 |
|
6079 |
P825E Minimal Labels
|
0 / 0 |
8 |
|
6075 |
P825G Tree Queries
|
0 / 0 |
9 |
|
6067 |
P827D Best Edge Weight
|
0 / 0 |
10 |
|
6047 |
P832D Misha, Grisha and Underground
|
0 / 0 |
6 |
|
6033 |
P835F Roads in the Kingdom
|
0 / 0 |
9 |
|
6024 |
P838B Diverging Directions
|
0 / 0 |
7 |
|
6017 |
P839C Journey
|
0 / 0 |
5 |
|
6013 |
P840B Leha and another game about graph
|
0 / 0 |
7 |
|
6005 |
P842C Ilya And The Tree
|
0 / 0 |
7 |
|
6003 |
P842E Nikita and game
|
0 / 0 |
10 |
|
6002 |
P843A Sorting by Subsequences
|
0 / 0 |
4 |
|
6000 |
P843C Upgrading Tree
|
0 / 0 |
10 |
|
5989 |
P845G Shortest Path Problem?
|
0 / 0 |
8 |
|
5984 |
P846E Chemistry in Berland
|
0 / 0 |
8 |
|
5974 |
P847I Noise Level
|
0 / 0 |
6 |
|
5971 |
P847L Berland SU Computer Network
|
0 / 0 |
9 |
|
5944 |
P852I Dating
|
0 / 0 |
8 |
|
5930 |
P855G Harry Vs Voldemort
|
0 / 0 |
10 |
|
5918 |
P858F Wizard's Tour
|
0 / 0 |
8 |
|
5913 |
P859E Desk Disorder
|
0 / 0 |
7 |
|
5910 |
P860E Arkady and a Nobody-men
|
0 / 0 |
10 |
|
5908 |
P862B Mahmoud and Ehab and the bipartiteness
|
0 / 0 |
4 |
|
5891 |
P864F Cities Excursions
|
0 / 0 |
10 |
|
5872 |
P869D The Overdosing Ubiquity
|
0 / 0 |
10 |
|
5866 |
P870E Points, Lines and Ready-made Titles
|
0 / 0 |
8 |
|
5855 |
P875C National Property
|
0 / 0 |
7 |
|
5846 |
P877D Olya and Energy Drinks
|
0 / 0 |
7 |
|
5830 |
P883G Orientation of Edges
|
0 / 0 |
6 |
|
5821 |
P884C Bertown Subway
|
0 / 0 |
5 |
|
5794 |
P891D Sloth
|
0 / 0 |
10 |
|
5788 |
P893C Rumor
|
9 / 21 |
4 |
|
5774 |
P896A Nephren gives a riddle
|
0 / 0 |
5 |
|
5748 |
P901C Bipartite Segments
|
0 / 0 |
8 |
|
5747 |
P901D Weighting a Tree
|
0 / 0 |
10 |
|
5744 |
P902B Coloring a Tree
|
0 / 0 |
4 |
|
5717 |
P909E Coprocessor
|
0 / 0 |
6 |
|
5715 |
P910A The Way to Home
|
0 / 0 |
3 |
|
5707 |
P911F Tree Destruction
|
0 / 0 |
9 |
|
5701 |
P912E Prime Gift
|
0 / 0 |
9 |
|
5681 |
P915D Almost Acyclic Graph
|
0 / 0 |
8 |
|
5671 |
P917B MADMAX
|
0 / 0 |
5 |
|
5662 |
P919D Substring
|
0 / 0 |
5 |
|
5657 |
P920C Swap Adjacent Elements
|
0 / 0 |
4 |
|
5655 |
P920E Connected Components?
|
0 / 0 |
7 |
|
5599 |
P930A Peculiar apple-tree
|
0 / 0 |
5 |
|
5590 |
P932B Recursive Queries
|
0 / 0 |
4 |
|
5573 |
P935E Fafa and Ancient Mathematics
|
0 / 0 |
8 |
|
5570 |
P936B Sleepy Game
|
0 / 0 |
7 |
|
5555 |
P939D Love Rescue
|
0 / 0 |
5 |
|
5539 |
P948A Protect Sheep
|
0 / 0 |
3 |
|
5536 |
P949C Data Center Maintenance
|
0 / 0 |
6 |
|
5520 |
P954D Fight Against Traffic
|
1 / 2 |
5 |
|
5503 |
P958B2 Maximum Control (medium)
|
0 / 0 |
8 |
|
5481 |
P960E Alternating Tree
|
0 / 0 |
8 |
|
5465 |
P962F Simple Cycles Edges
|
0 / 0 |
9 |
|
5462 |
P963B Destruction of a Tree
|
0 / 0 |
7 |
|
5435 |
P977D Divide by three, multiply by two
|
0 / 0 |
4 |
|
5434 |
P977E Cyclic Components
|
0 / 0 |
5 |
|
5423 |
P979C Kuro and Walking Route
|
0 / 0 |
5 |
|
5404 |
P982C Cut 'em all!
|
0 / 0 |
5 |
|
5401 |
P982F The Meeting Place Cannot Be Changed
|
0 / 0 |
10 |
|
5384 |
P986C AND Graph
|
0 / 0 |
9 |
|
5361 |
P990F Flow Control
|
0 / 0 |
9 |
|
5321 |
P999E Reachability from the Capital
|
1 / 1 |
7 |
|
5315 |
P1000E We Need More Bosses
|
1 / 1 |
7 |
|
5270 |
P1005F Berland and the Shortest Paths
|
0 / 0 |
7 |
|
5265 |
P1006E Military Problem
|
1 / 1 |
5 |
|
5246 |
P1010D Mars rover
|
0 / 0 |
7 |
|
5240 |
P1012B Chemical table
|
0 / 0 |
6 |
|
5221 |
P1016F Road Projects
|
0 / 0 |
10 |
|
5205 |
P1020B Badge
|
0 / 0 |
3 |
|
5199 |
P1023F Mobile Phone Network
|
0 / 0 |
10 |
|
5187 |
P1027D Mouse Hunt
|
0 / 0 |
5 |
|
5185 |
P1027F Session in BSU
|
0 / 0 |
9 |
|
5149 |
P1033A King Escape
|
0 / 0 |
3 |
|
5145 |
P1033E Hidden Bipartite Graph
|
0 / 0 |
10 |
|
5131 |
P1036G Sources and Sinks
|
0 / 0 |
10 |
|
5127 |
P1037D Valid BFS?
|
0 / 0 |
5 |
|
5118 |
P1038E Maximum Matching
|
0 / 0 |
9 |