|
30863 |
codeforces#P1297E
Modernization of Treeland
|
0 / 0 |
(无) |
|
30872 |
codeforces#P1299D
Around the World
|
0 / 0 |
10 |
|
30881 |
codeforces#P1301F
Super Jaber
|
0 / 0 |
10 |
|
30894 |
codeforces#P1303C
Perfect Keyboard
|
0 / 0 |
5 |
|
30903 |
codeforces#P1304E
1-Trees and Queries
|
0 / 0 |
7 |
|
30909 |
codeforces#P1305D
Kuroni and the Celebration
|
1 / 1 |
6 |
|
30917 |
codeforces#P1307D
Cow and Fields
|
0 / 0 |
6 |
|
30919 |
codeforces#P1307F
Cow and Vacation
|
0 / 0 |
10 |
|
30928 |
codeforces#P1311B
WeirdSort
|
0 / 0 |
4 |
|
30939 |
codeforces#P1312G
Autocompletion
|
0 / 0 |
10 |
|
30952 |
codeforces#P1316D
Nash Matrix
|
0 / 0 |
7 |
|
30956 |
codeforces#P1320B
Navigation System
|
0 / 0 |
5 |
|
30959 |
codeforces#P1320E
Treeland and Viruses
|
0 / 0 |
10 |
|
30973 |
codeforces#P1324C
Frog Jumps
|
0 / 0 |
3 |
|
30976 |
codeforces#P1324F
Maximum White Subtree
|
0 / 0 |
6 |
|
30979 |
codeforces#P1325C
Ehab and Path-etic MEXs
|
0 / 0 |
5 |
|
30981 |
codeforces#P1325E
Ehab's REAL Number Theory Problem
|
1 / 2 |
10 |
|
30982 |
codeforces#P1325F
Ehab's Last Theorem
|
0 / 0 |
9 |
|
30995 |
codeforces#P1327D
Infinite Path
|
0 / 0 |
8 |
|
31003 |
codeforces#P1328E
Tree Queries
|
2 / 4 |
6 |
|
31016 |
codeforces#P1331E
Jordan Smiley
|
1 / 2 |
10 |
|
31022 |
codeforces#P1332C
K-Complete Word
|
0 / 0 |
5 |
|
31025 |
codeforces#P1332F
Independent Set
|
0 / 0 |
9 |
|
31046 |
codeforces#P1335F
Robots on a Grid
|
0 / 0 |
8 |
|
31047 |
codeforces#P1336A
Linova and Kingdom
|
0 / 0 |
5 |
|
31057 |
codeforces#P1338B
Edge Weight Assignment
|
0 / 0 |
6 |
|
31059 |
codeforces#P1338D
Nested Rubber Bands
|
0 / 0 |
10 |
|
31065 |
codeforces#P1340C
Nastya and Unexpected Guest
|
1 / 6 |
9 |
|
31066 |
codeforces#P1340D
Nastya and Time Machine
|
0 / 0 |
10 |
|
31084 |
codeforces#P1344B
Monopole Magnets
|
0 / 0 |
7 |
|
31085 |
codeforces#P1344C
Quantifier Question
|
0 / 0 |
10 |
|
31105 |
codeforces#P1348F
Phoenix and Memory
|
0 / 0 |
10 |
|
31108 |
codeforces#P1349C
Orac and Game of Life
|
0 / 0 |
7 |
|
31123 |
codeforces#P1352F
Binary String Reconstruction
|
0 / 0 |
5 |
|
31136 |
codeforces#P1354E
Graph Coloring
|
0 / 0 |
7 |
|
31196 |
codeforces#P1361C
Johnny and Megan's Necklace
|
0 / 0 |
9 |
|
31198 |
codeforces#P1361E
James and the Chase
|
0 / 0 |
10 |
|
31207 |
codeforces#P1363E
Tree Shuffling
|
0 / 0 |
7 |
|
31212 |
codeforces#P1364D
Ehab's Last Corollary
|
0 / 0 |
7 |
|
31217 |
codeforces#P1365D
Solve The Maze
|
0 / 0 |
5 |
|
31232 |
codeforces#P1367E
Necklace Assembly
|
0 / 0 |
6 |
|
31248 |
codeforces#P1369E
DeadLee
|
0 / 0 |
9 |
|
31249 |
codeforces#P1369F
BareLee
|
0 / 0 |
10 |
|
31255 |
codeforces#P1370F1
The Hidden Pair (Easy Version)
|
1 / 1 |
9 |
|
31256 |
codeforces#P1370F2
The Hidden Pair (Hard Version)
|
0 / 0 |
10 |
|
31290 |
codeforces#P1375G
Tree Modification
|
0 / 0 |
10 |
|
31295 |
codeforces#P1379C
Choosing flowers
|
0 / 0 |
7 |
|
31311 |
codeforces#P1381D
The Majestic Brown Tree Snake
|
0 / 0 |
10 |
|
31328 |
codeforces#P1385E
Directing Edges
|
1 / 2 |
7 |
|
31330 |
codeforces#P1385G
Columns Swaps
|
0 / 0 |
8 |