|
|
5675 |
P916C
Jamie and Interesting Graph
|
0 / 0 |
5 |
|
|
5671 |
P917B
MADMAX
|
0 / 0 |
5 |
|
|
5662 |
P919D
Substring
|
0 / 0 |
5 |
|
|
5660 |
P919F
A Game With Numbers
|
0 / 0 |
10 |
|
|
5655 |
P920E
Connected Components?
|
0 / 0 |
7 |
|
|
5627 |
P923F
Public Service
|
0 / 0 |
10 |
|
|
5601 |
P928C
Dependency management
|
0 / 0 |
6 |
|
|
5599 |
P930A
Peculiar apple-tree
|
0 / 0 |
5 |
|
|
5582 |
P933C
A Colourful Prospect
|
0 / 0 |
10 |
|
|
5570 |
P936B
Sleepy Game
|
0 / 0 |
7 |
|
|
5562 |
P938D
Buy a Ticket
|
0 / 0 |
7 |
|
|
5559 |
P938G
Shortest Path Queries
|
0 / 0 |
10 |
|
|
5558 |
P939A
Love Triangle
|
0 / 0 |
3 |
|
|
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 |
|
|
5487 |
P959E
Mahmoud and Ehab and the xor-MST
|
0 / 0 |
6 |
|
|
5480 |
P960F
Pathwalks
|
1 / 1 |
7 |
|
|
5465 |
P962F
Simple Cycles Edges
|
0 / 0 |
9 |
|
|
5441 |
P976D
Degree Set
|
0 / 0 |
9 |
|
|
5439 |
P976F
Minimal k-covering
|
0 / 0 |
9 |
|
|
5434 |
P977E
Cyclic Components
|
0 / 0 |
5 |
|
|
5415 |
P980F
Cactus to Tree
|
0 / 0 |
10 |
|
|
5404 |
P982C
Cut 'em all!
|
0 / 0 |
5 |
|
|
5401 |
P982F
The Meeting Place Cannot Be Changed
|
0 / 0 |
10 |
|
|
5398 |
P983C
Elevator
|
0 / 0 |
9 |
|
|
5386 |
P986A
Fair
|
1 / 1 |
5 |
|
|
5384 |
P986C
AND Graph
|
0 / 0 |
9 |
|
|
5381 |
P986F
Oppa Funcan Style Remastered
|
0 / 0 |
10 |
|
|
5369 |
P989C
A Mist of Florescence
|
0 / 0 |
6 |
|
|
5363 |
P990D
Graph And Its Complement
|
0 / 0 |
5 |
|
|
5336 |
P995E
Number Clicker
|
0 / 0 |
10 |
|
|
5321 |
P999E
Reachability from the Capital
|
1 / 1 |
7 |
|
|
5315 |
P1000E
We Need More Bosses
|
1 / 1 |
7 |
|
|
5284 |
P1003E
Tree Constructing
|
1 / 2 |
7 |
|
|
5270 |
P1005F
Berland and the Shortest Paths
|
0 / 0 |
7 |
|
|
5265 |
P1006E
Military Problem
|
1 / 1 |
5 |
|
|
5253 |
P1009D
Relatively Prime Graph
|
0 / 0 |
5 |
|
|
5250 |
P1009G
Allowed Letters
|
0 / 0 |
9 |
|
|
5246 |
P1010D
Mars rover
|
0 / 0 |
7 |
|
|
5244 |
P1010F
Tree
|
0 / 0 |
10 |
|
|
5240 |
P1012B
Chemical table
|
0 / 0 |
6 |
|
|
5209 |
P1019C
Sergey's problem
|
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 |
|
|
5171 |
P1029E
Tree with Small Distances
|
0 / 0 |
7 |
|
|
5157 |
P1031F
Familiar Operations
|
0 / 0 |
10 |
|
|
5149 |
P1033A
King Escape
|
0 / 0 |
3 |
|
|
5145 |
P1033E
Hidden Bipartite Graph
|
0 / 0 |
10 |
|
|
5127 |
P1037D
Valid BFS?
|
0 / 0 |
5 |
|
|
5126 |
P1037E
Trips
|
0 / 0 |
8 |
|
|
5118 |
P1038E
Maximum Matching
|
0 / 0 |
9 |
|
|
5114 |
P1039C
Network Safety
|
0 / 0 |
8 |
|
|
5105 |
P1041E
Tree Reconstruction
|
0 / 0 |
6 |
|
|
5098 |
P1042F
Leaf Sets
|
0 / 0 |
9 |
|
|
5084 |
P1045A
Last chance
|
0 / 0 |
9 |
|
|
5082 |
P1045C
Hyperspace Highways
|
0 / 0 |
8 |
|
|
5064 |
P1051F
The Shortest Statement
|
0 / 0 |
9 |
|
|
5053 |
P1055A
Metro
|
0 / 0 |
3 |
|
|
5043 |
P1056D
Decorate Apple Tree
|
0 / 0 |
5 |
|
|
5040 |
P1056G
Take Metro
|
0 / 0 |
10 |
|
|
5018 |
P1061E
Politics
|
0 / 0 |
10 |
|
|
5013 |
P1062D
Fun with Integers
|
0 / 0 |
6 |
|
|
5011 |
P1062F
Upgrading Cities
|
0 / 0 |
10 |
|
|
5009 |
P1063B
Labyrinth
|
0 / 0 |
6 |
|
|
5001 |
P1065B
Vasya and Isolated Vertices
|
1 / 1 |
4 |
|
|
4988 |
P1067B
Multihedgehog
|
0 / 0 |
6 |
|
|
4982 |
P1068C
Colored Rooks
|
0 / 0 |
5 |
|
|
4981 |
P1070A
Find a Number
|
0 / 0 |
8 |
|
|
4973 |
P1070I
Privatization of Roads in Berland
|
0 / 0 |
9 |
|
|
4955 |
P1076D
Edge Deletion
|
1 / 2 |
6 |
|
|
4934 |
P1081D
Maximum Distance
|
0 / 0 |
6 |
|
|
4926 |
P1082D
Maximum Diameter Graph
|
0 / 0 |
6 |
|
|
4923 |
P1082G
Petya and Graph
|
0 / 0 |
9 |
|
|
4869 |
P1091E
New Year and the Acquaintance Estimation
|
0 / 0 |
9 |
|
|
4855 |
P1093D
Beautiful Graph
|
0 / 0 |
5 |
|
|
4846 |
P1095F
Make It Connected
|
0 / 0 |
6 |
|
|
4828 |
P1098C
Construct a tree
|
0 / 3 |
9 |
|
|
4816 |
P1100E
Andrew and Taxi
|
0 / 0 |
8 |
|
|
4802 |
P1102F
Elongated Matrix
|
0 / 0 |
7 |
|
|
4799 |
P1103C
Johnny Solving
|
0 / 0 |
10 |
|
|
4791 |
P1105D
Kilani and the Game
|
0 / 0 |
6 |
|
|
4786 |
P1106D
Lunar New Year and a Wander
|
0 / 0 |
5 |
|
|
4778 |
P1107F
Vasya and Endless Credits
|
0 / 0 |
10 |
|
|
4770 |
P1108F
MST Unification
|
0 / 0 |
7 |
|
|
4751 |
P1111E
Tree
|
0 / 0 |
9 |
|
|
4697 |
P1120D
Power Tree
|
0 / 0 |
9 |
|
|
4679 |
P1131D
Gourmet choice
|
0 / 0 |
7 |
|
|
4663 |
P1133F1
Spanning Tree with Maximum Degree
|
0 / 0 |
5 |
|
|
4662 |
P1133F2
Spanning Tree with One Fixed Degree
|
0 / 0 |
6 |
|
|
4654 |
P1137C
Museums Tour
|
0 / 0 |
9 |
|
|
4646 |
P1139C
Edgy Trees
|
0 / 0 |
5 |
|
|
4644 |
P1139E
Maximize Mex
|
0 / 0 |
9 |
|
|
4628 |
P1141G
Privatization of Roads in Treeland
|
0 / 0 |
6 |
|
|
4623 |
P1142E
Pink Floyd
|
0 / 0 |
10 |
|
|
4614 |
P1144F
Graph Without Long Directed Paths
|
0 / 0 |
5 |
