|
5623 |
P780E
Underground Lab
|
0 / 0 |
7 |
|
5607 |
P786A
Berzerk
|
0 / 0 |
7 |
|
5604 |
P786D
Rap God
|
0 / 0 |
10 |
|
5599 |
P788B
Weird journey
|
0 / 0 |
7 |
|
5598 |
P788C
The Great Mixing
|
0 / 0 |
8 |
|
5585 |
P793B
Igor and his way to work
|
0 / 0 |
5 |
|
5582 |
P793E
Problem of offices
|
0 / 0 |
10 |
|
5576 |
P794D
Labelling Cities
|
0 / 0 |
9 |
|
5569 |
P796D
Police Stations
|
0 / 0 |
7 |
|
5563 |
P797D
Broken BST
|
0 / 0 |
7 |
|
5537 |
P802J
Send the Fool Further! (easy)
|
0 / 0 |
4 |
|
5535 |
P802L
Send the Fool Further! (hard)
|
0 / 0 |
9 |
|
5522 |
P804C
Ice cream coloring
|
0 / 0 |
8 |
|
5521 |
P804D
Expected diameter of a tree
|
0 / 0 |
9 |
|
5519 |
P804F
Fake bullions
|
0 / 0 |
10 |
|
5497 |
P811D
Vladik and Favorite Game
|
0 / 0 |
7 |
|
5492 |
P812D
Sagheer and Kindergarten
|
0 / 0 |
10 |
|
5488 |
P813C
The Tag Game
|
0 / 0 |
5 |
|
5481 |
P814D
An overnight dance in discotheque
|
0 / 0 |
7 |
|
5449 |
P821D
Okabe and City
|
0 / 0 |
8 |
|
5442 |
P822F
Madness
|
0 / 0 |
9 |
|
5437 |
P825E
Minimal Labels
|
0 / 0 |
8 |
|
5435 |
P825G
Tree Queries
|
0 / 0 |
9 |
|
5431 |
P827D
Best Edge Weight
|
0 / 0 |
10 |
|
5415 |
P832D
Misha, Grisha and Underground
|
0 / 0 |
6 |
|
5401 |
P835F
Roads in the Kingdom
|
0 / 0 |
9 |
|
5392 |
P838B
Diverging Directions
|
0 / 0 |
7 |
|
5385 |
P839C
Journey
|
0 / 0 |
5 |
|
5381 |
P840B
Leha and another game about graph
|
0 / 0 |
7 |
|
5373 |
P842C
Ilya And The Tree
|
0 / 0 |
7 |
|
5371 |
P842E
Nikita and game
|
0 / 0 |
10 |
|
5370 |
P843A
Sorting by Subsequences
|
0 / 0 |
4 |
|
5368 |
P843C
Upgrading Tree
|
0 / 0 |
10 |
|
5357 |
P845G
Shortest Path Problem?
|
0 / 0 |
8 |
|
5352 |
P846E
Chemistry in Berland
|
0 / 0 |
8 |
|
5342 |
P847I
Noise Level
|
0 / 0 |
6 |
|
5339 |
P847L
Berland SU Computer Network
|
0 / 0 |
9 |
|
5314 |
P852I
Dating
|
0 / 0 |
8 |
|
5300 |
P855G
Harry Vs Voldemort
|
0 / 0 |
10 |
|
5288 |
P858F
Wizard's Tour
|
0 / 0 |
8 |
|
5283 |
P859E
Desk Disorder
|
0 / 0 |
7 |
|
5280 |
P860E
Arkady and a Nobody-men
|
0 / 0 |
10 |
|
5278 |
P862B
Mahmoud and Ehab and the bipartiteness
|
0 / 0 |
4 |
|
5261 |
P864F
Cities Excursions
|
0 / 0 |
10 |
|
5242 |
P869D
The Overdosing Ubiquity
|
0 / 0 |
10 |
|
5236 |
P870E
Points, Lines and Ready-made Titles
|
0 / 0 |
8 |
|
5225 |
P875C
National Property
|
0 / 0 |
7 |
|
5216 |
P877D
Olya and Energy Drinks
|
0 / 0 |
7 |
|
5200 |
P883G
Orientation of Edges
|
0 / 0 |
6 |
|
5191 |
P884C
Bertown Subway
|
0 / 0 |
5 |
|
5164 |
P891D
Sloth
|
0 / 0 |
10 |
|
5158 |
P893C
Rumor
|
0 / 0 |
4 |
|
5144 |
P896A
Nephren gives a riddle
|
0 / 0 |
5 |
|
5118 |
P901C
Bipartite Segments
|
0 / 0 |
8 |
|
5117 |
P901D
Weighting a Tree
|
0 / 0 |
10 |
|
5114 |
P902B
Coloring a Tree
|
0 / 0 |
4 |
|
5087 |
P909E
Coprocessor
|
0 / 0 |
6 |
|
5085 |
P910A
The Way to Home
|
0 / 0 |
3 |
|
5077 |
P911F
Tree Destruction
|
0 / 0 |
9 |
|
5071 |
P912E
Prime Gift
|
0 / 0 |
9 |
|
5051 |
P915D
Almost Acyclic Graph
|
0 / 0 |
8 |
|
5041 |
P917B
MADMAX
|
0 / 0 |
5 |
|
5032 |
P919D
Substring
|
0 / 0 |
5 |
|
5027 |
P920C
Swap Adjacent Elements
|
0 / 0 |
4 |
|
5025 |
P920E
Connected Components?
|
0 / 0 |
7 |
|
4969 |
P930A
Peculiar apple-tree
|
0 / 0 |
5 |
|
4960 |
P932B
Recursive Queries
|
0 / 0 |
4 |
|
4943 |
P935E
Fafa and Ancient Mathematics
|
0 / 0 |
8 |
|
4940 |
P936B
Sleepy Game
|
0 / 0 |
7 |
|
4925 |
P939D
Love Rescue
|
0 / 0 |
5 |
|
4909 |
P948A
Protect Sheep
|
0 / 0 |
3 |
|
4906 |
P949C
Data Center Maintenance
|
0 / 0 |
6 |
|
4890 |
P954D
Fight Against Traffic
|
0 / 0 |
5 |
|
4873 |
P958B2
Maximum Control (medium)
|
0 / 0 |
8 |
|
4851 |
P960E
Alternating Tree
|
0 / 0 |
8 |
|
4835 |
P962F
Simple Cycles Edges
|
0 / 0 |
9 |
|
4832 |
P963B
Destruction of a Tree
|
0 / 0 |
7 |
|
4805 |
P977D
Divide by three, multiply by two
|
0 / 0 |
4 |
|
4804 |
P977E
Cyclic Components
|
0 / 0 |
5 |
|
4793 |
P979C
Kuro and Walking Route
|
0 / 0 |
5 |
|
4774 |
P982C
Cut 'em all!
|
0 / 0 |
5 |
|
4771 |
P982F
The Meeting Place Cannot Be Changed
|
0 / 0 |
10 |
|
4754 |
P986C
AND Graph
|
0 / 0 |
9 |
|
4731 |
P990F
Flow Control
|
0 / 0 |
9 |
|
4691 |
P999E
Reachability from the Capital
|
0 / 0 |
7 |
|
4685 |
P1000E
We Need More Bosses
|
0 / 0 |
7 |
|
4640 |
P1005F
Berland and the Shortest Paths
|
0 / 0 |
7 |
|
4635 |
P1006E
Military Problem
|
0 / 0 |
5 |
|
4616 |
P1010D
Mars rover
|
0 / 0 |
7 |
|
4610 |
P1012B
Chemical table
|
0 / 0 |
6 |
|
4591 |
P1016F
Road Projects
|
0 / 0 |
10 |
|
4575 |
P1020B
Badge
|
0 / 0 |
3 |
|
4569 |
P1023F
Mobile Phone Network
|
0 / 0 |
10 |
|
4557 |
P1027D
Mouse Hunt
|
0 / 0 |
5 |
|
4555 |
P1027F
Session in BSU
|
0 / 0 |
9 |
|
4519 |
P1033A
King Escape
|
0 / 0 |
3 |
|
4515 |
P1033E
Hidden Bipartite Graph
|
0 / 0 |
10 |
|
4501 |
P1036G
Sources and Sinks
|
0 / 0 |
10 |
|
4497 |
P1037D
Valid BFS?
|
0 / 0 |
5 |
|
4488 |
P1038E
Maximum Matching
|
0 / 0 |
9 |