|
|
4569 |
P916C
Jamie and Interesting Graph
|
0 / 0 |
5 |
|
|
4565 |
P917B
MADMAX
|
0 / 0 |
5 |
|
|
4556 |
P919D
Substring
|
0 / 0 |
5 |
|
|
4554 |
P919F
A Game With Numbers
|
0 / 0 |
10 |
|
|
4549 |
P920E
Connected Components?
|
0 / 0 |
7 |
|
|
4521 |
P923F
Public Service
|
0 / 0 |
10 |
|
|
4495 |
P928C
Dependency management
|
0 / 0 |
6 |
|
|
4493 |
P930A
Peculiar apple-tree
|
0 / 0 |
5 |
|
|
4476 |
P933C
A Colourful Prospect
|
0 / 0 |
10 |
|
|
4464 |
P936B
Sleepy Game
|
0 / 0 |
7 |
|
|
4456 |
P938D
Buy a Ticket
|
0 / 0 |
7 |
|
|
4453 |
P938G
Shortest Path Queries
|
0 / 0 |
10 |
|
|
4452 |
P939A
Love Triangle
|
0 / 0 |
3 |
|
|
4449 |
P939D
Love Rescue
|
0 / 0 |
5 |
|
|
4433 |
P948A
Protect Sheep
|
0 / 0 |
3 |
|
|
4430 |
P949C
Data Center Maintenance
|
0 / 0 |
6 |
|
|
4414 |
P954D
Fight Against Traffic
|
0 / 0 |
5 |
|
|
4397 |
P958B2
Maximum Control (medium)
|
0 / 0 |
8 |
|
|
4381 |
P959E
Mahmoud and Ehab and the xor-MST
|
0 / 0 |
6 |
|
|
4374 |
P960F
Pathwalks
|
0 / 0 |
7 |
|
|
4359 |
P962F
Simple Cycles Edges
|
0 / 0 |
9 |
|
|
4335 |
P976D
Degree Set
|
0 / 0 |
9 |
|
|
4333 |
P976F
Minimal k-covering
|
0 / 0 |
9 |
|
|
4328 |
P977E
Cyclic Components
|
0 / 0 |
5 |
|
|
4309 |
P980F
Cactus to Tree
|
0 / 0 |
10 |
|
|
4298 |
P982C
Cut 'em all!
|
0 / 0 |
5 |
|
|
4295 |
P982F
The Meeting Place Cannot Be Changed
|
0 / 0 |
10 |
|
|
4292 |
P983C
Elevator
|
0 / 0 |
9 |
|
|
4280 |
P986A
Fair
|
0 / 0 |
5 |
|
|
4278 |
P986C
AND Graph
|
0 / 0 |
9 |
|
|
4275 |
P986F
Oppa Funcan Style Remastered
|
0 / 0 |
10 |
|
|
4263 |
P989C
A Mist of Florescence
|
0 / 0 |
6 |
|
|
4257 |
P990D
Graph And Its Complement
|
0 / 0 |
5 |
|
|
4230 |
P995E
Number Clicker
|
0 / 0 |
10 |
|
|
4215 |
P999E
Reachability from the Capital
|
0 / 0 |
7 |
|
|
4209 |
P1000E
We Need More Bosses
|
0 / 0 |
7 |
|
|
4178 |
P1003E
Tree Constructing
|
0 / 0 |
7 |
|
|
4164 |
P1005F
Berland and the Shortest Paths
|
0 / 0 |
7 |
|
|
4159 |
P1006E
Military Problem
|
0 / 0 |
5 |
|
|
4147 |
P1009D
Relatively Prime Graph
|
0 / 0 |
5 |
|
|
4144 |
P1009G
Allowed Letters
|
0 / 0 |
9 |
|
|
4140 |
P1010D
Mars rover
|
0 / 0 |
7 |
|
|
4138 |
P1010F
Tree
|
0 / 0 |
10 |
|
|
4134 |
P1012B
Chemical table
|
0 / 0 |
6 |
|
|
4103 |
P1019C
Sergey's problem
|
0 / 0 |
10 |
|
|
4099 |
P1020B
Badge
|
0 / 0 |
3 |
|
|
4093 |
P1023F
Mobile Phone Network
|
0 / 0 |
10 |
|
|
4081 |
P1027D
Mouse Hunt
|
0 / 0 |
5 |
|
|
4079 |
P1027F
Session in BSU
|
0 / 0 |
9 |
|
|
4065 |
P1029E
Tree with Small Distances
|
0 / 0 |
7 |
|
|
4051 |
P1031F
Familiar Operations
|
0 / 0 |
10 |
|
|
4043 |
P1033A
King Escape
|
0 / 0 |
3 |
|
|
4039 |
P1033E
Hidden Bipartite Graph
|
0 / 0 |
10 |
|
|
4021 |
P1037D
Valid BFS?
|
0 / 0 |
5 |
|
|
4020 |
P1037E
Trips
|
0 / 0 |
8 |
|
|
4012 |
P1038E
Maximum Matching
|
0 / 0 |
9 |
|
|
4008 |
P1039C
Network Safety
|
0 / 0 |
8 |
|
|
3999 |
P1041E
Tree Reconstruction
|
0 / 0 |
6 |
|
|
3992 |
P1042F
Leaf Sets
|
0 / 0 |
9 |
|
|
3978 |
P1045A
Last chance
|
0 / 0 |
9 |
|
|
3976 |
P1045C
Hyperspace Highways
|
0 / 0 |
8 |
|
|
3958 |
P1051F
The Shortest Statement
|
0 / 0 |
9 |
|
|
3947 |
P1055A
Metro
|
0 / 0 |
3 |
|
|
3937 |
P1056D
Decorate Apple Tree
|
0 / 0 |
5 |
|
|
3934 |
P1056G
Take Metro
|
0 / 0 |
10 |
|
|
3912 |
P1061E
Politics
|
0 / 0 |
10 |
|
|
3907 |
P1062D
Fun with Integers
|
0 / 0 |
6 |
|
|
3905 |
P1062F
Upgrading Cities
|
0 / 0 |
10 |
|
|
3903 |
P1063B
Labyrinth
|
0 / 0 |
6 |
|
|
3895 |
P1065B
Vasya and Isolated Vertices
|
0 / 0 |
4 |
|
|
3882 |
P1067B
Multihedgehog
|
0 / 0 |
6 |
|
|
3876 |
P1068C
Colored Rooks
|
0 / 0 |
5 |
|
|
3875 |
P1070A
Find a Number
|
0 / 0 |
8 |
|
|
3867 |
P1070I
Privatization of Roads in Berland
|
0 / 0 |
9 |
|
|
3849 |
P1076D
Edge Deletion
|
0 / 0 |
6 |
|
|
3828 |
P1081D
Maximum Distance
|
0 / 0 |
6 |
|
|
3820 |
P1082D
Maximum Diameter Graph
|
0 / 0 |
6 |
|
|
3817 |
P1082G
Petya and Graph
|
0 / 0 |
9 |
|
|
3746 |
P1091E
New Year and the Acquaintance Estimation
|
0 / 0 |
9 |
|
|
3732 |
P1093D
Beautiful Graph
|
0 / 0 |
5 |
|
|
3723 |
P1095F
Make It Connected
|
0 / 0 |
6 |
|
|
3705 |
P1098C
Construct a tree
|
0 / 0 |
9 |
|
|
3693 |
P1100E
Andrew and Taxi
|
0 / 0 |
8 |
|
|
3679 |
P1102F
Elongated Matrix
|
0 / 0 |
7 |
|
|
3676 |
P1103C
Johnny Solving
|
0 / 0 |
10 |
|
|
3668 |
P1105D
Kilani and the Game
|
0 / 0 |
6 |
|
|
3663 |
P1106D
Lunar New Year and a Wander
|
0 / 0 |
5 |
|
|
3655 |
P1107F
Vasya and Endless Credits
|
0 / 0 |
10 |
|
|
3647 |
P1108F
MST Unification
|
0 / 0 |
7 |
|
|
3628 |
P1111E
Tree
|
0 / 0 |
9 |
|
|
3574 |
P1120D
Power Tree
|
0 / 0 |
9 |
|
|
3556 |
P1131D
Gourmet choice
|
0 / 0 |
7 |
|
|
3540 |
P1133F1
Spanning Tree with Maximum Degree
|
0 / 0 |
5 |
|
|
3539 |
P1133F2
Spanning Tree with One Fixed Degree
|
0 / 0 |
6 |
|
|
3531 |
P1137C
Museums Tour
|
0 / 0 |
9 |
|
|
3523 |
P1139C
Edgy Trees
|
0 / 0 |
5 |
|
|
3521 |
P1139E
Maximize Mex
|
0 / 0 |
9 |
|
|
3505 |
P1141G
Privatization of Roads in Treeland
|
0 / 0 |
6 |
|
|
3500 |
P1142E
Pink Floyd
|
0 / 0 |
10 |
|
|
3491 |
P1144F
Graph Without Long Directed Paths
|
0 / 0 |
5 |
