|
|
4271 |
P916C
Jamie and Interesting Graph
|
0 / 0 |
5 |
|
|
4267 |
P917B
MADMAX
|
0 / 0 |
5 |
|
|
4258 |
P919D
Substring
|
0 / 0 |
5 |
|
|
4256 |
P919F
A Game With Numbers
|
0 / 0 |
10 |
|
|
4251 |
P920E
Connected Components?
|
0 / 0 |
7 |
|
|
4223 |
P923F
Public Service
|
0 / 0 |
10 |
|
|
4197 |
P928C
Dependency management
|
0 / 0 |
6 |
|
|
4195 |
P930A
Peculiar apple-tree
|
0 / 0 |
5 |
|
|
4178 |
P933C
A Colourful Prospect
|
0 / 0 |
10 |
|
|
4166 |
P936B
Sleepy Game
|
0 / 0 |
7 |
|
|
4158 |
P938D
Buy a Ticket
|
0 / 0 |
7 |
|
|
4155 |
P938G
Shortest Path Queries
|
0 / 0 |
10 |
|
|
4154 |
P939A
Love Triangle
|
0 / 0 |
3 |
|
|
4151 |
P939D
Love Rescue
|
0 / 0 |
5 |
|
|
4135 |
P948A
Protect Sheep
|
0 / 0 |
3 |
|
|
4132 |
P949C
Data Center Maintenance
|
0 / 0 |
6 |
|
|
4116 |
P954D
Fight Against Traffic
|
0 / 0 |
5 |
|
|
4099 |
P958B2
Maximum Control (medium)
|
0 / 0 |
8 |
|
|
4083 |
P959E
Mahmoud and Ehab and the xor-MST
|
0 / 0 |
6 |
|
|
4076 |
P960F
Pathwalks
|
0 / 0 |
7 |
|
|
4061 |
P962F
Simple Cycles Edges
|
0 / 0 |
9 |
|
|
4037 |
P976D
Degree Set
|
0 / 0 |
9 |
|
|
4035 |
P976F
Minimal k-covering
|
0 / 0 |
9 |
|
|
4030 |
P977E
Cyclic Components
|
0 / 0 |
5 |
|
|
4011 |
P980F
Cactus to Tree
|
0 / 0 |
10 |
|
|
4000 |
P982C
Cut 'em all!
|
0 / 0 |
5 |
|
|
3997 |
P982F
The Meeting Place Cannot Be Changed
|
0 / 0 |
10 |
|
|
3994 |
P983C
Elevator
|
0 / 0 |
9 |
|
|
3982 |
P986A
Fair
|
0 / 0 |
5 |
|
|
3980 |
P986C
AND Graph
|
0 / 0 |
9 |
|
|
3977 |
P986F
Oppa Funcan Style Remastered
|
0 / 0 |
10 |
|
|
3965 |
P989C
A Mist of Florescence
|
0 / 0 |
6 |
|
|
3959 |
P990D
Graph And Its Complement
|
0 / 0 |
5 |
|
|
3932 |
P995E
Number Clicker
|
0 / 0 |
10 |
|
|
3917 |
P999E
Reachability from the Capital
|
0 / 0 |
7 |
|
|
3911 |
P1000E
We Need More Bosses
|
0 / 0 |
7 |
|
|
3880 |
P1003E
Tree Constructing
|
0 / 0 |
7 |
|
|
3866 |
P1005F
Berland and the Shortest Paths
|
0 / 0 |
7 |
|
|
3861 |
P1006E
Military Problem
|
0 / 0 |
5 |
|
|
3849 |
P1009D
Relatively Prime Graph
|
0 / 0 |
5 |
|
|
3846 |
P1009G
Allowed Letters
|
0 / 0 |
9 |
|
|
3842 |
P1010D
Mars rover
|
0 / 0 |
7 |
|
|
3840 |
P1010F
Tree
|
0 / 0 |
10 |
|
|
3836 |
P1012B
Chemical table
|
0 / 0 |
6 |
|
|
3805 |
P1019C
Sergey's problem
|
0 / 0 |
10 |
|
|
3801 |
P1020B
Badge
|
0 / 0 |
3 |
|
|
3795 |
P1023F
Mobile Phone Network
|
0 / 0 |
10 |
|
|
3783 |
P1027D
Mouse Hunt
|
0 / 0 |
5 |
|
|
3781 |
P1027F
Session in BSU
|
0 / 0 |
9 |
|
|
3767 |
P1029E
Tree with Small Distances
|
0 / 0 |
7 |
|
|
3753 |
P1031F
Familiar Operations
|
0 / 0 |
10 |
|
|
3745 |
P1033A
King Escape
|
0 / 0 |
3 |
|
|
3741 |
P1033E
Hidden Bipartite Graph
|
0 / 0 |
10 |
|
|
3723 |
P1037D
Valid BFS?
|
0 / 0 |
5 |
|
|
3722 |
P1037E
Trips
|
0 / 0 |
8 |
|
|
3714 |
P1038E
Maximum Matching
|
0 / 0 |
9 |
|
|
3710 |
P1039C
Network Safety
|
0 / 0 |
8 |
|
|
3701 |
P1041E
Tree Reconstruction
|
0 / 0 |
6 |
|
|
3694 |
P1042F
Leaf Sets
|
0 / 0 |
9 |
|
|
3680 |
P1045A
Last chance
|
0 / 0 |
9 |
|
|
3678 |
P1045C
Hyperspace Highways
|
0 / 0 |
8 |
|
|
3660 |
P1051F
The Shortest Statement
|
0 / 0 |
9 |
|
|
3649 |
P1055A
Metro
|
0 / 0 |
3 |
|
|
3639 |
P1056D
Decorate Apple Tree
|
0 / 0 |
5 |
|
|
3636 |
P1056G
Take Metro
|
0 / 0 |
10 |
|
|
3614 |
P1061E
Politics
|
0 / 0 |
10 |
|
|
3609 |
P1062D
Fun with Integers
|
0 / 0 |
6 |
|
|
3607 |
P1062F
Upgrading Cities
|
0 / 0 |
10 |
|
|
3605 |
P1063B
Labyrinth
|
0 / 0 |
6 |
|
|
3597 |
P1065B
Vasya and Isolated Vertices
|
0 / 0 |
4 |
|
|
3584 |
P1067B
Multihedgehog
|
0 / 0 |
6 |
|
|
3578 |
P1068C
Colored Rooks
|
0 / 0 |
5 |
|
|
3577 |
P1070A
Find a Number
|
0 / 0 |
8 |
|
|
3569 |
P1070I
Privatization of Roads in Berland
|
0 / 0 |
9 |
|
|
3551 |
P1076D
Edge Deletion
|
0 / 0 |
6 |
|
|
3530 |
P1081D
Maximum Distance
|
0 / 0 |
6 |
|
|
3522 |
P1082D
Maximum Diameter Graph
|
0 / 0 |
6 |
|
|
3519 |
P1082G
Petya and Graph
|
0 / 0 |
9 |
|
|
3465 |
P1091E
New Year and the Acquaintance Estimation
|
0 / 0 |
9 |
|
|
3451 |
P1093D
Beautiful Graph
|
0 / 0 |
5 |
|
|
3442 |
P1095F
Make It Connected
|
0 / 0 |
6 |
|
|
3424 |
P1098C
Construct a tree
|
0 / 0 |
9 |
|
|
3412 |
P1100E
Andrew and Taxi
|
0 / 0 |
8 |
|
|
3398 |
P1102F
Elongated Matrix
|
0 / 0 |
7 |
|
|
3395 |
P1103C
Johnny Solving
|
0 / 0 |
10 |
|
|
3387 |
P1105D
Kilani and the Game
|
0 / 0 |
6 |
|
|
3382 |
P1106D
Lunar New Year and a Wander
|
0 / 0 |
5 |
|
|
3374 |
P1107F
Vasya and Endless Credits
|
0 / 0 |
10 |
|
|
3366 |
P1108F
MST Unification
|
0 / 0 |
7 |
|
|
3347 |
P1111E
Tree
|
0 / 0 |
9 |
|
|
3293 |
P1120D
Power Tree
|
0 / 0 |
9 |
|
|
3275 |
P1131D
Gourmet choice
|
0 / 0 |
7 |
|
|
3259 |
P1133F1
Spanning Tree with Maximum Degree
|
0 / 0 |
5 |
|
|
3258 |
P1133F2
Spanning Tree with One Fixed Degree
|
0 / 0 |
6 |
|
|
3250 |
P1137C
Museums Tour
|
0 / 0 |
9 |
|
|
3242 |
P1139C
Edgy Trees
|
0 / 0 |
5 |
|
|
3240 |
P1139E
Maximize Mex
|
0 / 0 |
9 |
|
|
3224 |
P1141G
Privatization of Roads in Treeland
|
0 / 0 |
6 |
|
|
3219 |
P1142E
Pink Floyd
|
0 / 0 |
10 |
|
|
3210 |
P1144F
Graph Without Long Directed Paths
|
0 / 0 |
5 |
