|
|
1297 |
codeforces#P1297E Modernization of Treeland
|
0 / 0 |
(无) |
|
|
1288 |
codeforces#P1299D Around the World
|
0 / 0 |
10 |
|
|
1279 |
codeforces#P1301F Super Jaber
|
0 / 0 |
10 |
|
|
1266 |
codeforces#P1303C Perfect Keyboard
|
0 / 0 |
5 |
|
|
1257 |
codeforces#P1304E 1-Trees and Queries
|
0 / 0 |
7 |
|
|
1251 |
codeforces#P1305D Kuroni and the Celebration
|
1 / 1 |
6 |
|
|
1243 |
codeforces#P1307D Cow and Fields
|
0 / 0 |
6 |
|
|
1241 |
codeforces#P1307F Cow and Vacation
|
0 / 0 |
10 |
|
|
1232 |
codeforces#P1311B WeirdSort
|
0 / 0 |
4 |
|
|
1221 |
codeforces#P1312G Autocompletion
|
0 / 0 |
10 |
|
|
1208 |
codeforces#P1316D Nash Matrix
|
0 / 0 |
7 |
|
|
1204 |
codeforces#P1320B Navigation System
|
0 / 0 |
5 |
|
|
1201 |
codeforces#P1320E Treeland and Viruses
|
0 / 0 |
10 |
|
|
1187 |
codeforces#P1324C Frog Jumps
|
0 / 0 |
3 |
|
|
1186 |
codeforces#P1324F Maximum White Subtree
|
0 / 0 |
6 |
|
|
1181 |
codeforces#P1325C Ehab and Path-etic MEXs
|
0 / 0 |
5 |
|
|
1180 |
codeforces#P1325E Ehab's REAL Number Theory Problem
|
1 / 2 |
10 |
|
|
1178 |
codeforces#P1325F Ehab's Last Theorem
|
0 / 0 |
9 |
|
|
1166 |
codeforces#P1327D Infinite Path
|
0 / 0 |
8 |
|
|
1157 |
codeforces#P1328E Tree Queries
|
2 / 4 |
6 |
|
|
1144 |
codeforces#P1331E Jordan Smiley
|
1 / 2 |
10 |
|
|
1139 |
codeforces#P1332C K-Complete Word
|
0 / 0 |
5 |
|
|
1136 |
codeforces#P1332F Independent Set
|
0 / 0 |
9 |
|
|
1114 |
codeforces#P1335F Robots on a Grid
|
0 / 0 |
8 |
|
|
1113 |
codeforces#P1336A Linova and Kingdom
|
0 / 0 |
5 |
|
|
1103 |
codeforces#P1338B Edge Weight Assignment
|
0 / 0 |
6 |
|
|
1100 |
codeforces#P1338D Nested Rubber Bands
|
0 / 0 |
10 |
|
|
1095 |
codeforces#P1340C Nastya and Unexpected Guest
|
1 / 6 |
9 |
|
|
1094 |
codeforces#P1340D Nastya and Time Machine
|
0 / 0 |
10 |
|
|
1077 |
codeforces#P1344B Monopole Magnets
|
0 / 0 |
7 |
|
|
1075 |
codeforces#P1344C Quantifier Question
|
0 / 0 |
10 |
|
|
1056 |
codeforces#P1348F Phoenix and Memory
|
0 / 0 |
10 |
|
|
1053 |
codeforces#P1349C Orac and Game of Life
|
0 / 0 |
7 |
|
|
1038 |
codeforces#P1352F Binary String Reconstruction
|
0 / 0 |
5 |
|
|
1025 |
codeforces#P1354E Graph Coloring
|
0 / 0 |
7 |
|
|
965 |
codeforces#P1361C Johnny and Megan's Necklace
|
0 / 0 |
9 |
|
|
963 |
codeforces#P1361E James and the Chase
|
0 / 0 |
10 |
|
|
954 |
codeforces#P1363E Tree Shuffling
|
0 / 0 |
7 |
|
|
949 |
codeforces#P1364D Ehab's Last Corollary
|
0 / 0 |
7 |
|
|
944 |
codeforces#P1365D Solve The Maze
|
0 / 0 |
5 |
|
|
929 |
codeforces#P1367E Necklace Assembly
|
0 / 0 |
6 |
|
|
913 |
codeforces#P1369E DeadLee
|
0 / 0 |
9 |
|
|
912 |
codeforces#P1369F BareLee
|
0 / 0 |
10 |
|
|
906 |
codeforces#P1370F1 The Hidden Pair (Easy Version)
|
1 / 1 |
9 |
|
|
905 |
codeforces#P1370F2 The Hidden Pair (Hard Version)
|
0 / 0 |
10 |
|
|
871 |
codeforces#P1375G Tree Modification
|
0 / 0 |
10 |
|
|
866 |
codeforces#P1379C Choosing flowers
|
0 / 0 |
7 |
|
|
850 |
codeforces#P1381D The Majestic Brown Tree Snake
|
0 / 0 |
10 |
|
|
833 |
codeforces#P1385E Directing Edges
|
1 / 2 |
7 |
|
|
831 |
codeforces#P1385G Columns Swaps
|
0 / 0 |
8 |
