|
|
1977 |
codeforces#P1166F Vicky's Delivery Service
|
0 / 0 |
9 |
|
|
1933 |
codeforces#P1175F The Number of Subpermutations
|
1 / 2 |
9 |
|
|
1897 |
codeforces#P1182D Complete Mirror
|
0 / 0 |
9 |
|
|
1898 |
codeforces#P1182D Complete Mirror
|
0 / 0 |
9 |
|
|
1788 |
codeforces#P1200E Compress Words
|
1 / 7 |
7 |
|
|
1746 |
codeforces#P1207G Indie Album
|
0 / 0 |
10 |
|
|
1698 |
codeforces#P1214D Treasure Island
|
0 / 0 |
6 |
|
|
1644 |
codeforces#P1223F Stack Exterminable Arrays
|
0 / 0 |
10 |
|
|
1638 |
codeforces#P1225D Power Products
|
1 / 2 |
6 |
|
|
1621 |
codeforces#P1228D Complete Tripartite
|
0 / 0 |
6 |
|
|
1518 |
codeforces#P1252F Regular Forestation
|
1 / 2 |
9 |
|
|
1485 |
codeforces#P1257F Make Them Similar
|
0 / 0 |
9 |
|
|
1398 |
codeforces#P1277D Let's Play the Words?
|
0 / 0 |
6 |
|
|
1363 |
codeforces#P1284D New Year and Conference
|
1 / 4 |
7 |
|
|
1349 |
codeforces#P1286C2 Madhouse (Hard version)
|
0 / 0 |
10 |
|
|
1215 |
codeforces#P1313E Concatenation with intersection
|
0 / 0 |
10 |
|
|
1202 |
codeforces#P1320D Reachable Strings
|
0 / 0 |
9 |
|
|
1195 |
codeforces#P1322C Instant Noodles
|
0 / 0 |
8 |
|
|
1174 |
codeforces#P1326D1 Prefix-Suffix Palindrome (Easy version)
|
0 / 0 |
5 |
|
|
1173 |
codeforces#P1326D2 Prefix-Suffix Palindrome (Hard version)
|
0 / 0 |
6 |
|
|
1092 |
codeforces#P1340F Nastya and CBS
|
0 / 0 |
10 |
|
|
970 |
codeforces#P1360F Spy-string
|
0 / 0 |
5 |
|
|
793 |
codeforces#P1393E1 Twilight and Ancient Scroll (easier version)
|
0 / 0 |
10 |
|
|
792 |
codeforces#P1393E2 Twilight and Ancient Scroll (harder version)
|
0 / 0 |
10 |
|
|
790 |
codeforces#P1394B Boboniu Walks on Graph
|
0 / 0 |
8 |
|
|
678 |
codeforces#P1418G Three Occurrences
|
0 / 0 |
9 |
|
|
517 |
codeforces#P1451C String Equality
|
0 / 0 |
4 |
|
|
450 |
codeforces#P1466G Song of the Sirens
|
0 / 0 |
10 |
|
|
437 |
codeforces#P1468F Full Turn
|
0 / 0 |
5 |
|
|
424 |
codeforces#P1469E A Bit Similar
|
0 / 0 |
9 |
|
|
421 |
codeforces#P1470B Strange Definition
|
0 / 0 |
6 |
|
|
383 |
codeforces#P1476E Pattern Matching
|
0 / 0 |
8 |
|
|
381 |
codeforces#P1476G Minimum Difference
|
0 / 0 |
10 |
|
|
295 |
codeforces#P1493D GCD of an Array
|
1 / 1 |
7 |
|
|
288 |
codeforces#P1494E A-Z Graph
|
0 / 0 |
9 |
|
|
258 |
codeforces#P1500A Going Home
|
0 / 0 |
6 |
|
|
100 |
codeforces#P1520D Same Differences
|
1 / 2 |
4 |
|
|
101 |
codeforces#P1520D Same Differences
|
0 / 0 |
4 |
|
|
61 |
codeforces#P1527C Sequence Pair Weight
|
0 / 0 |
5 |
|
|
7118 |
codeforces#P1533D String Searching
|
0 / 0 |
(无) |
|
|
28 |
codeforces#P1535F String Distance
|
0 / 0 |
10 |
|
|
25 |
codeforces#P1536C Diluc and Kaeya
|
0 / 0 |
5 |
|
|
17 |
codeforces#P1537E1 Erase and Extend (Easy Version)
|
0 / 0 |
5 |
|
|
16 |
codeforces#P1537E2 Erase and Extend (Hard Version)
|
0 / 0 |
8 |
|
|
10 |
codeforces#P1538E Funny Substrings
|
0 / 0 |
7 |
|
|
7285 |
codeforces#P1569E Playoff Restoration
|
0 / 0 |
(无) |
|
|
7309 |
codeforces#P1574D The Strongest Build
|
1 / 11 |
10 |
|
|
7487 |
codeforces#P1610G AmShZ Wins a Bet
|
1 / 1 |
10 |
|
|
7584 |
codeforces#P1621I Two Sequences
|
0 / 0 |
10 |
|
|
7565 |
codeforces#P1622F Quadratic Set
|
1 / 1 |
10 |
