|
|
5516 |
P915F
Imbalance Value of a Tree
|
0 / 0 |
9 |
|
|
5512 |
P916C
Jamie and Interesting Graph
|
0 / 0 |
5 |
|
|
5508 |
P917B
MADMAX
|
0 / 0 |
5 |
|
|
5499 |
P919D
Substring
|
0 / 0 |
5 |
|
|
5497 |
P919F
A Game With Numbers
|
0 / 0 |
10 |
|
|
5492 |
P920E
Connected Components?
|
0 / 0 |
7 |
|
|
5464 |
P923F
Public Service
|
0 / 0 |
10 |
|
|
5438 |
P928C
Dependency management
|
0 / 0 |
6 |
|
|
5436 |
P930A
Peculiar apple-tree
|
0 / 0 |
5 |
|
|
5419 |
P933C
A Colourful Prospect
|
0 / 0 |
10 |
|
|
5407 |
P936B
Sleepy Game
|
0 / 0 |
7 |
|
|
5399 |
P938D
Buy a Ticket
|
0 / 0 |
7 |
|
|
5396 |
P938G
Shortest Path Queries
|
0 / 0 |
10 |
|
|
5395 |
P939A
Love Triangle
|
0 / 0 |
3 |
|
|
5392 |
P939D
Love Rescue
|
0 / 0 |
5 |
|
|
5376 |
P948A
Protect Sheep
|
0 / 0 |
3 |
|
|
5373 |
P949C
Data Center Maintenance
|
0 / 0 |
6 |
|
|
5357 |
P954D
Fight Against Traffic
|
0 / 0 |
5 |
|
|
5340 |
P958B2
Maximum Control (medium)
|
0 / 0 |
8 |
|
|
5324 |
P959E
Mahmoud and Ehab and the xor-MST
|
0 / 0 |
6 |
|
|
5317 |
P960F
Pathwalks
|
0 / 0 |
7 |
|
|
5302 |
P962F
Simple Cycles Edges
|
0 / 0 |
9 |
|
|
5278 |
P976D
Degree Set
|
0 / 0 |
9 |
|
|
5276 |
P976F
Minimal k-covering
|
0 / 0 |
9 |
|
|
5271 |
P977E
Cyclic Components
|
0 / 0 |
5 |
|
|
5252 |
P980F
Cactus to Tree
|
0 / 0 |
10 |
|
|
5241 |
P982C
Cut 'em all!
|
0 / 0 |
5 |
|
|
5238 |
P982F
The Meeting Place Cannot Be Changed
|
0 / 0 |
10 |
|
|
5235 |
P983C
Elevator
|
0 / 0 |
9 |
|
|
5223 |
P986A
Fair
|
0 / 0 |
5 |
|
|
5221 |
P986C
AND Graph
|
0 / 0 |
9 |
|
|
5218 |
P986F
Oppa Funcan Style Remastered
|
0 / 0 |
10 |
|
|
5206 |
P989C
A Mist of Florescence
|
0 / 0 |
6 |
|
|
5200 |
P990D
Graph And Its Complement
|
0 / 0 |
5 |
|
|
5173 |
P995E
Number Clicker
|
0 / 0 |
10 |
|
|
5158 |
P999E
Reachability from the Capital
|
0 / 0 |
7 |
|
|
5152 |
P1000E
We Need More Bosses
|
0 / 0 |
7 |
|
|
5121 |
P1003E
Tree Constructing
|
0 / 0 |
7 |
|
|
5107 |
P1005F
Berland and the Shortest Paths
|
0 / 0 |
7 |
|
|
5102 |
P1006E
Military Problem
|
0 / 0 |
5 |
|
|
5090 |
P1009D
Relatively Prime Graph
|
0 / 0 |
5 |
|
|
5087 |
P1009G
Allowed Letters
|
0 / 0 |
9 |
|
|
5083 |
P1010D
Mars rover
|
0 / 0 |
7 |
|
|
5081 |
P1010F
Tree
|
0 / 0 |
10 |
|
|
5077 |
P1012B
Chemical table
|
0 / 0 |
6 |
|
|
5046 |
P1019C
Sergey's problem
|
0 / 0 |
10 |
|
|
5042 |
P1020B
Badge
|
0 / 0 |
3 |
|
|
5036 |
P1023F
Mobile Phone Network
|
0 / 0 |
10 |
|
|
5024 |
P1027D
Mouse Hunt
|
0 / 0 |
5 |
|
|
5022 |
P1027F
Session in BSU
|
0 / 0 |
9 |
|
|
5008 |
P1029E
Tree with Small Distances
|
0 / 0 |
7 |
|
|
4994 |
P1031F
Familiar Operations
|
0 / 0 |
10 |
|
|
4986 |
P1033A
King Escape
|
0 / 0 |
3 |
|
|
4982 |
P1033E
Hidden Bipartite Graph
|
0 / 0 |
10 |
|
|
4964 |
P1037D
Valid BFS?
|
0 / 0 |
5 |
|
|
4963 |
P1037E
Trips
|
0 / 0 |
8 |
|
|
4955 |
P1038E
Maximum Matching
|
0 / 0 |
9 |
|
|
4951 |
P1039C
Network Safety
|
0 / 0 |
8 |
|
|
4942 |
P1041E
Tree Reconstruction
|
0 / 0 |
6 |
|
|
4935 |
P1042F
Leaf Sets
|
0 / 0 |
9 |
|
|
4921 |
P1045A
Last chance
|
0 / 0 |
9 |
|
|
4919 |
P1045C
Hyperspace Highways
|
0 / 0 |
8 |
|
|
4901 |
P1051F
The Shortest Statement
|
0 / 0 |
9 |
|
|
4890 |
P1055A
Metro
|
0 / 0 |
3 |
|
|
4880 |
P1056D
Decorate Apple Tree
|
0 / 0 |
5 |
|
|
4877 |
P1056G
Take Metro
|
0 / 0 |
10 |
|
|
4855 |
P1061E
Politics
|
0 / 0 |
10 |
|
|
4850 |
P1062D
Fun with Integers
|
0 / 0 |
6 |
|
|
4848 |
P1062F
Upgrading Cities
|
0 / 0 |
10 |
|
|
4846 |
P1063B
Labyrinth
|
0 / 0 |
6 |
|
|
4838 |
P1065B
Vasya and Isolated Vertices
|
0 / 0 |
4 |
|
|
4825 |
P1067B
Multihedgehog
|
0 / 0 |
6 |
|
|
4819 |
P1068C
Colored Rooks
|
0 / 0 |
5 |
|
|
4818 |
P1070A
Find a Number
|
0 / 0 |
8 |
|
|
4810 |
P1070I
Privatization of Roads in Berland
|
0 / 0 |
9 |
|
|
4792 |
P1076D
Edge Deletion
|
0 / 0 |
6 |
|
|
4771 |
P1081D
Maximum Distance
|
0 / 0 |
6 |
|
|
4763 |
P1082D
Maximum Diameter Graph
|
0 / 0 |
6 |
|
|
4760 |
P1082G
Petya and Graph
|
0 / 0 |
9 |
|
|
4706 |
P1091E
New Year and the Acquaintance Estimation
|
0 / 0 |
9 |
|
|
4692 |
P1093D
Beautiful Graph
|
0 / 0 |
5 |
|
|
4683 |
P1095F
Make It Connected
|
0 / 0 |
6 |
|
|
4665 |
P1098C
Construct a tree
|
0 / 0 |
9 |
|
|
4653 |
P1100E
Andrew and Taxi
|
0 / 0 |
8 |
|
|
4639 |
P1102F
Elongated Matrix
|
0 / 0 |
7 |
|
|
4636 |
P1103C
Johnny Solving
|
0 / 0 |
10 |
|
|
4628 |
P1105D
Kilani and the Game
|
0 / 0 |
6 |
|
|
4623 |
P1106D
Lunar New Year and a Wander
|
0 / 0 |
5 |
|
|
4615 |
P1107F
Vasya and Endless Credits
|
0 / 0 |
10 |
|
|
4607 |
P1108F
MST Unification
|
0 / 0 |
7 |
|
|
4588 |
P1111E
Tree
|
0 / 0 |
9 |
|
|
4534 |
P1120D
Power Tree
|
0 / 0 |
9 |
|
|
4516 |
P1131D
Gourmet choice
|
0 / 0 |
7 |
|
|
4500 |
P1133F1
Spanning Tree with Maximum Degree
|
0 / 0 |
5 |
|
|
4499 |
P1133F2
Spanning Tree with One Fixed Degree
|
0 / 0 |
6 |
|
|
4491 |
P1137C
Museums Tour
|
0 / 0 |
9 |
|
|
4483 |
P1139C
Edgy Trees
|
0 / 0 |
5 |
|
|
4481 |
P1139E
Maximize Mex
|
0 / 0 |
9 |
|
|
4465 |
P1141G
Privatization of Roads in Treeland
|
0 / 0 |
6 |
|
|
4460 |
P1142E
Pink Floyd
|
0 / 0 |
10 |