|
|
5049 |
P915F
Imbalance Value of a Tree
|
0 / 0 |
9 |
|
|
5045 |
P916C
Jamie and Interesting Graph
|
0 / 0 |
5 |
|
|
5041 |
P917B
MADMAX
|
0 / 0 |
5 |
|
|
5032 |
P919D
Substring
|
0 / 0 |
5 |
|
|
5030 |
P919F
A Game With Numbers
|
0 / 0 |
10 |
|
|
5025 |
P920E
Connected Components?
|
0 / 0 |
7 |
|
|
4997 |
P923F
Public Service
|
0 / 0 |
10 |
|
|
4971 |
P928C
Dependency management
|
0 / 0 |
6 |
|
|
4969 |
P930A
Peculiar apple-tree
|
0 / 0 |
5 |
|
|
4952 |
P933C
A Colourful Prospect
|
0 / 0 |
10 |
|
|
4940 |
P936B
Sleepy Game
|
0 / 0 |
7 |
|
|
4932 |
P938D
Buy a Ticket
|
0 / 0 |
7 |
|
|
4929 |
P938G
Shortest Path Queries
|
0 / 0 |
10 |
|
|
4928 |
P939A
Love Triangle
|
0 / 0 |
3 |
|
|
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 |
|
|
4857 |
P959E
Mahmoud and Ehab and the xor-MST
|
0 / 0 |
6 |
|
|
4850 |
P960F
Pathwalks
|
0 / 0 |
7 |
|
|
4835 |
P962F
Simple Cycles Edges
|
0 / 0 |
9 |
|
|
4811 |
P976D
Degree Set
|
0 / 0 |
9 |
|
|
4809 |
P976F
Minimal k-covering
|
0 / 0 |
9 |
|
|
4804 |
P977E
Cyclic Components
|
0 / 0 |
5 |
|
|
4785 |
P980F
Cactus to Tree
|
0 / 0 |
10 |
|
|
4774 |
P982C
Cut 'em all!
|
0 / 0 |
5 |
|
|
4771 |
P982F
The Meeting Place Cannot Be Changed
|
0 / 0 |
10 |
|
|
4768 |
P983C
Elevator
|
0 / 0 |
9 |
|
|
4756 |
P986A
Fair
|
0 / 0 |
5 |
|
|
4754 |
P986C
AND Graph
|
0 / 0 |
9 |
|
|
4751 |
P986F
Oppa Funcan Style Remastered
|
0 / 0 |
10 |
|
|
4739 |
P989C
A Mist of Florescence
|
0 / 0 |
6 |
|
|
4733 |
P990D
Graph And Its Complement
|
0 / 0 |
5 |
|
|
4706 |
P995E
Number Clicker
|
0 / 0 |
10 |
|
|
4691 |
P999E
Reachability from the Capital
|
0 / 0 |
7 |
|
|
4685 |
P1000E
We Need More Bosses
|
0 / 0 |
7 |
|
|
4654 |
P1003E
Tree Constructing
|
0 / 0 |
7 |
|
|
4640 |
P1005F
Berland and the Shortest Paths
|
0 / 0 |
7 |
|
|
4635 |
P1006E
Military Problem
|
0 / 0 |
5 |
|
|
4623 |
P1009D
Relatively Prime Graph
|
0 / 0 |
5 |
|
|
4620 |
P1009G
Allowed Letters
|
0 / 0 |
9 |
|
|
4616 |
P1010D
Mars rover
|
0 / 0 |
7 |
|
|
4614 |
P1010F
Tree
|
0 / 0 |
10 |
|
|
4610 |
P1012B
Chemical table
|
0 / 0 |
6 |
|
|
4579 |
P1019C
Sergey's problem
|
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 |
|
|
4541 |
P1029E
Tree with Small Distances
|
0 / 0 |
7 |
|
|
4527 |
P1031F
Familiar Operations
|
0 / 0 |
10 |
|
|
4519 |
P1033A
King Escape
|
0 / 0 |
3 |
|
|
4515 |
P1033E
Hidden Bipartite Graph
|
0 / 0 |
10 |
|
|
4497 |
P1037D
Valid BFS?
|
0 / 0 |
5 |
|
|
4496 |
P1037E
Trips
|
0 / 0 |
8 |
|
|
4488 |
P1038E
Maximum Matching
|
0 / 0 |
9 |
|
|
4484 |
P1039C
Network Safety
|
0 / 0 |
8 |
|
|
4475 |
P1041E
Tree Reconstruction
|
0 / 0 |
6 |
|
|
4468 |
P1042F
Leaf Sets
|
0 / 0 |
9 |
|
|
4454 |
P1045A
Last chance
|
0 / 0 |
9 |
|
|
4452 |
P1045C
Hyperspace Highways
|
0 / 0 |
8 |
|
|
4434 |
P1051F
The Shortest Statement
|
0 / 0 |
9 |
|
|
4423 |
P1055A
Metro
|
0 / 0 |
3 |
|
|
4413 |
P1056D
Decorate Apple Tree
|
0 / 0 |
5 |
|
|
4410 |
P1056G
Take Metro
|
0 / 0 |
10 |
|
|
4388 |
P1061E
Politics
|
0 / 0 |
10 |
|
|
4383 |
P1062D
Fun with Integers
|
0 / 0 |
6 |
|
|
4381 |
P1062F
Upgrading Cities
|
0 / 0 |
10 |
|
|
4379 |
P1063B
Labyrinth
|
0 / 0 |
6 |
|
|
4371 |
P1065B
Vasya and Isolated Vertices
|
0 / 0 |
4 |
|
|
4358 |
P1067B
Multihedgehog
|
0 / 0 |
6 |
|
|
4352 |
P1068C
Colored Rooks
|
0 / 0 |
5 |
|
|
4351 |
P1070A
Find a Number
|
0 / 0 |
8 |
|
|
4343 |
P1070I
Privatization of Roads in Berland
|
0 / 0 |
9 |
|
|
4325 |
P1076D
Edge Deletion
|
0 / 0 |
6 |
|
|
4304 |
P1081D
Maximum Distance
|
0 / 0 |
6 |
|
|
4296 |
P1082D
Maximum Diameter Graph
|
0 / 0 |
6 |
|
|
4293 |
P1082G
Petya and Graph
|
0 / 0 |
9 |
|
|
4239 |
P1091E
New Year and the Acquaintance Estimation
|
0 / 0 |
9 |
|
|
4225 |
P1093D
Beautiful Graph
|
0 / 0 |
5 |
|
|
4216 |
P1095F
Make It Connected
|
0 / 0 |
6 |
|
|
4198 |
P1098C
Construct a tree
|
0 / 0 |
9 |
|
|
4186 |
P1100E
Andrew and Taxi
|
0 / 0 |
8 |
|
|
4172 |
P1102F
Elongated Matrix
|
0 / 0 |
7 |
|
|
4169 |
P1103C
Johnny Solving
|
0 / 0 |
10 |
|
|
4161 |
P1105D
Kilani and the Game
|
0 / 0 |
6 |
|
|
4156 |
P1106D
Lunar New Year and a Wander
|
0 / 0 |
5 |
|
|
4148 |
P1107F
Vasya and Endless Credits
|
0 / 0 |
10 |
|
|
4140 |
P1108F
MST Unification
|
0 / 0 |
7 |
|
|
4121 |
P1111E
Tree
|
0 / 0 |
9 |
|
|
4067 |
P1120D
Power Tree
|
0 / 0 |
9 |
|
|
4049 |
P1131D
Gourmet choice
|
0 / 0 |
7 |
|
|
4033 |
P1133F1
Spanning Tree with Maximum Degree
|
0 / 0 |
5 |
|
|
4032 |
P1133F2
Spanning Tree with One Fixed Degree
|
0 / 0 |
6 |
|
|
4024 |
P1137C
Museums Tour
|
0 / 0 |
9 |
|
|
4016 |
P1139C
Edgy Trees
|
0 / 0 |
5 |
|
|
4014 |
P1139E
Maximize Mex
|
0 / 0 |
9 |
|
|
3998 |
P1141G
Privatization of Roads in Treeland
|
0 / 0 |
6 |
|
|
3993 |
P1142E
Pink Floyd
|
0 / 0 |
10 |
