|
30055 |
codeforces#P1142E
Pink Floyd
|
0 / 0 |
10 |
|
30064 |
codeforces#P1144F
Graph Without Long Directed Paths
|
0 / 0 |
5 |
|
30075 |
codeforces#P1146C
Tree Diameter
|
0 / 0 |
5 |
|
30079 |
codeforces#P1146G
Zoning Restrictions
|
0 / 0 |
10 |
|
30081 |
codeforces#P1147A
Hide and Seek
|
0 / 0 |
5 |
|
30084 |
codeforces#P1147D
Palindrome XOR
|
0 / 0 |
9 |
|
30093 |
codeforces#P1148G
Gold Experience
|
1 / 1 |
10 |
|
30098 |
codeforces#P1149D
Abandoning Roads
|
0 / 0 |
10 |
|
30099 |
codeforces#P1149E
Election Promises
|
0 / 0 |
10 |
|
30112 |
codeforces#P1152E
Neko and Flashback
|
0 / 0 |
9 |
|
30133 |
codeforces#P1155F
Delivery Oligopoly
|
0 / 0 |
10 |
|
30140 |
codeforces#P1156G
Optimizer
|
0 / 0 |
10 |
|
30151 |
codeforces#P1158C
Permutation recovery
|
0 / 1 |
7 |
|
30166 |
codeforces#P1163E
Magical Permutation
|
0 / 0 |
9 |
|
30167 |
codeforces#P1163F
Indecisive Taxi Fee
|
1 / 2 |
10 |
|
30180 |
codeforces#P1166F
Vicky's Delivery Service
|
0 / 0 |
9 |
|
30183 |
codeforces#P1167C
News Distribution
|
0 / 0 |
4 |
|
30194 |
codeforces#P1169B
Pairs
|
0 / 0 |
5 |
|
30201 |
codeforces#P1170G
Graph Decomposition
|
0 / 0 |
(无) |
|
30218 |
codeforces#P1174F
Ehab and the Big Finale
|
0 / 0 |
9 |
|
30229 |
codeforces#P1176D
Recover it!
|
0 / 0 |
6 |
|
30230 |
codeforces#P1176E
Cover it!
|
0 / 0 |
5 |
|
30242 |
codeforces#P1178H
Stock Exchange
|
1 / 5 |
10 |
|
30267 |
codeforces#P1183E
Subsequences (easy version)
|
0 / 0 |
7 |
|
30275 |
codeforces#P1184B2
The Doctor Meets Vader (Medium)
|
0 / 0 |
8 |
|
30283 |
codeforces#P1184E1
Daleks' Invasion (easy)
|
0 / 0 |
6 |
|
30284 |
codeforces#P1184E2
Daleks' Invasion (medium)
|
0 / 0 |
7 |
|
30285 |
codeforces#P1184E3
Daleks' Invasion (hard)
|
0 / 0 |
9 |
|
30299 |
codeforces#P1186F
Vus the Cossack and a Graph
|
0 / 0 |
9 |
|
30306 |
codeforces#P1187G
Gang Up
|
0 / 0 |
9 |
|
30359 |
codeforces#P1198C
Matching vs Independent Set
|
0 / 0 |
7 |
|
30361 |
codeforces#P1198E
Rectangle Painting 2
|
0 / 0 |
9 |
|
30370 |
codeforces#P1200F
Graph Traveler
|
0 / 0 |
8 |
|
30375 |
codeforces#P1201E1
Knightmare (easy)
|
1 / 1 |
10 |
|
30376 |
codeforces#P1201E2
Knightmare (hard)
|
1 / 2 |
10 |
|
30393 |
codeforces#P1204C
Anna, Svyatoslav and Maps
|
0 / 0 |
5 |
|
30398 |
codeforces#P1205B
Shortest Cycle
|
1 / 1 |
6 |
|
30423 |
codeforces#P1209D
Cow and Snacks
|
0 / 0 |
5 |
|
30426 |
codeforces#P1209F
Koala and Notebook
|
2 / 4 |
10 |
|
30430 |
codeforces#P1210A
Anadi and Domino
|
0 / 0 |
5 |
|
30433 |
codeforces#P1210D
Konrad and Company Evaluation
|
0 / 0 |
9 |
|
30443 |
codeforces#P1211F
kotlinkotlinkotlinkotlin...
|
0 / 0 |
8 |
|
30446 |
codeforces#P1211I
Unusual Graph
|
0 / 0 |
10 |
|
30453 |
codeforces#P1213F
Unstable String Sort
|
0 / 0 |
7 |
|
30454 |
codeforces#P1213G
Path Queries
|
1 / 1 |
6 |
|
30459 |
codeforces#P1214E
Petya and Construction Set
|
0 / 0 |
7 |
|
30480 |
codeforces#P1217D
Coloring Edges
|
1 / 2 |
7 |
|
30482 |
codeforces#P1217F
Forced Online Queries Problem
|
0 / 0 |
10 |
|
30483 |
codeforces#P1218A
BubbleReactor
|
0 / 0 |
10 |
|
30486 |
codeforces#P1218D
Xor Spanning Tree
|
0 / 0 |
9 |