|
29005 |
codeforces#P915D
Almost Acyclic Graph
|
0 / 0 |
8 |
|
29007 |
codeforces#P915F
Imbalance Value of a Tree
|
1 / 10 |
9 |
|
29011 |
codeforces#P916C
Jamie and Interesting Graph
|
0 / 1 |
5 |
|
29015 |
codeforces#P917B
MADMAX
|
0 / 0 |
5 |
|
29024 |
codeforces#P919D
Substring
|
0 / 0 |
5 |
|
29026 |
codeforces#P919F
A Game With Numbers
|
0 / 0 |
10 |
|
29031 |
codeforces#P920E
Connected Components?
|
1 / 1 |
7 |
|
29045 |
codeforces#P923F
Public Service
|
0 / 0 |
10 |
|
29071 |
codeforces#P928C
Dependency management
|
0 / 0 |
6 |
|
29077 |
codeforces#P930A
Peculiar apple-tree
|
0 / 0 |
5 |
|
29094 |
codeforces#P933C
A Colourful Prospect
|
0 / 0 |
10 |
|
29106 |
codeforces#P936B
Sleepy Game
|
0 / 0 |
7 |
|
29114 |
codeforces#P938D
Buy a Ticket
|
1 / 1 |
7 |
|
29117 |
codeforces#P938G
Shortest Path Queries
|
2 / 8 |
10 |
|
29118 |
codeforces#P939A
Love Triangle
|
2 / 2 |
3 |
|
29121 |
codeforces#P939D
Love Rescue
|
0 / 0 |
5 |
|
29137 |
codeforces#P948A
Protect Sheep
|
1 / 1 |
3 |
|
29140 |
codeforces#P949C
Data Center Maintenance
|
0 / 0 |
6 |
|
29156 |
codeforces#P954D
Fight Against Traffic
|
1 / 2 |
5 |
|
29173 |
codeforces#P958B2
Maximum Control (medium)
|
0 / 0 |
8 |
|
29189 |
codeforces#P959E
Mahmoud and Ehab and the xor-MST
|
0 / 0 |
6 |
|
29196 |
codeforces#P960F
Pathwalks
|
0 / 0 |
7 |
|
29212 |
codeforces#P962F
Simple Cycles Edges
|
0 / 0 |
9 |
|
29236 |
codeforces#P976D
Degree Set
|
0 / 0 |
9 |
|
29238 |
codeforces#P976F
Minimal k-covering
|
1 / 1 |
9 |
|
29243 |
codeforces#P977E
Cyclic Components
|
0 / 0 |
5 |
|
29262 |
codeforces#P980F
Cactus to Tree
|
0 / 0 |
10 |
|
29273 |
codeforces#P982C
Cut 'em all!
|
0 / 0 |
5 |
|
29276 |
codeforces#P982F
The Meeting Place Cannot Be Changed
|
0 / 0 |
10 |
|
29279 |
codeforces#P983C
Elevator
|
0 / 0 |
9 |
|
29291 |
codeforces#P986A
Fair
|
0 / 0 |
5 |
|
29293 |
codeforces#P986C
AND Graph
|
0 / 0 |
9 |
|
29296 |
codeforces#P986F
Oppa Funcan Style Remastered
|
0 / 0 |
10 |
|
29308 |
codeforces#P989C
A Mist of Florescence
|
0 / 0 |
6 |
|
29314 |
codeforces#P990D
Graph And Its Complement
|
0 / 0 |
5 |
|
29341 |
codeforces#P995E
Number Clicker
|
0 / 0 |
10 |
|
29356 |
codeforces#P999E
Reachability from the Capital
|
1 / 1 |
7 |
|
29362 |
codeforces#P1000E
We Need More Bosses
|
0 / 0 |
7 |
|
29394 |
codeforces#P1003E
Tree Constructing
|
1 / 2 |
7 |
|
29408 |
codeforces#P1005F
Berland and the Shortest Paths
|
0 / 0 |
7 |
|
29413 |
codeforces#P1006E
Military Problem
|
0 / 0 |
5 |
|
29425 |
codeforces#P1009D
Relatively Prime Graph
|
0 / 0 |
5 |
|
29428 |
codeforces#P1009G
Allowed Letters
|
0 / 0 |
9 |
|
29432 |
codeforces#P1010D
Mars rover
|
0 / 0 |
7 |
|
29434 |
codeforces#P1010F
Tree
|
0 / 0 |
10 |
|
29438 |
codeforces#P1012B
Chemical table
|
0 / 0 |
6 |
|
29469 |
codeforces#P1019C
Sergey's problem
|
0 / 0 |
10 |
|
29473 |
codeforces#P1020B
Badge
|
0 / 0 |
3 |
|
29479 |
codeforces#P1023F
Mobile Phone Network
|
1 / 1 |
10 |
|
29491 |
codeforces#P1027D
Mouse Hunt
|
0 / 0 |
5 |