|
|
30180 |
codeforces#P1166F
Vicky's Delivery Service
|
0 / 0 |
9 |
|
|
30224 |
codeforces#P1175F
The Number of Subpermutations
|
1 / 2 |
9 |
|
|
30259 |
codeforces#P1182D
Complete Mirror
|
0 / 0 |
9 |
|
|
30260 |
codeforces#P1182D
Complete Mirror
|
0 / 0 |
9 |
|
|
30369 |
codeforces#P1200E
Compress Words
|
2 / 8 |
7 |
|
|
30411 |
codeforces#P1207G
Indie Album
|
0 / 0 |
10 |
|
|
30458 |
codeforces#P1214D
Treasure Island
|
0 / 0 |
6 |
|
|
30513 |
codeforces#P1223F
Stack Exterminable Arrays
|
0 / 0 |
10 |
|
|
30519 |
codeforces#P1225D
Power Products
|
1 / 2 |
6 |
|
|
30536 |
codeforces#P1228D
Complete Tripartite
|
0 / 0 |
6 |
|
|
30639 |
codeforces#P1252F
Regular Forestation
|
1 / 2 |
9 |
|
|
30672 |
codeforces#P1257F
Make Them Similar
|
0 / 0 |
9 |
|
|
30762 |
codeforces#P1277D
Let's Play the Words?
|
0 / 0 |
6 |
|
|
30798 |
codeforces#P1284D
New Year and Conference
|
1 / 4 |
7 |
|
|
30811 |
codeforces#P1286C2
Madhouse (Hard version)
|
0 / 0 |
10 |
|
|
30945 |
codeforces#P1313E
Concatenation with intersection
|
0 / 0 |
10 |
|
|
30958 |
codeforces#P1320D
Reachable Strings
|
0 / 0 |
9 |
|
|
30965 |
codeforces#P1322C
Instant Noodles
|
0 / 0 |
8 |
|
|
30986 |
codeforces#P1326D1
Prefix-Suffix Palindrome (Easy version)
|
0 / 0 |
5 |
|
|
30987 |
codeforces#P1326D2
Prefix-Suffix Palindrome (Hard version)
|
0 / 0 |
6 |
|
|
31068 |
codeforces#P1340F
Nastya and CBS
|
0 / 0 |
10 |
|
|
31191 |
codeforces#P1360F
Spy-string
|
0 / 0 |
5 |
|
|
31368 |
codeforces#P1393E1
Twilight and Ancient Scroll (easier version)
|
0 / 0 |
10 |
|
|
31369 |
codeforces#P1393E2
Twilight and Ancient Scroll (harder version)
|
0 / 0 |
10 |
|
|
31371 |
codeforces#P1394B
Boboniu Walks on Graph
|
0 / 0 |
8 |
|
|
31483 |
codeforces#P1418G
Three Occurrences
|
0 / 0 |
9 |
|
|
31645 |
codeforces#P1451C
String Equality
|
0 / 0 |
4 |
|
|
31711 |
codeforces#P1466G
Song of the Sirens
|
0 / 0 |
10 |
|
|
31724 |
codeforces#P1468F
Full Turn
|
0 / 0 |
5 |
|
|
31737 |
codeforces#P1469E
A Bit Similar
|
0 / 0 |
9 |
|
|
31740 |
codeforces#P1470B
Strange Definition
|
0 / 0 |
6 |
|
|
31778 |
codeforces#P1476E
Pattern Matching
|
0 / 0 |
8 |
|
|
31780 |
codeforces#P1476G
Minimum Difference
|
0 / 0 |
10 |
|
|
31866 |
codeforces#P1493D
GCD of an Array
|
1 / 1 |
7 |
|
|
31873 |
codeforces#P1494E
A-Z Graph
|
0 / 0 |
9 |
|
|
31903 |
codeforces#P1500A
Going Home
|
0 / 0 |
6 |
|
|
32063 |
codeforces#P1520D
Same Differences
|
1 / 2 |
4 |
|
|
32064 |
codeforces#P1520D
Same Differences
|
0 / 0 |
4 |
|
|
32103 |
codeforces#P1527C
Sequence Pair Weight
|
0 / 0 |
5 |
|
|
32139 |
codeforces#P1533D
String Searching
|
0 / 0 |
(无) |
|
|
32160 |
codeforces#P1535F
String Distance
|
0 / 0 |
10 |
|
|
32163 |
codeforces#P1536C
Diluc and Kaeya
|
0 / 0 |
5 |
|
|
32171 |
codeforces#P1537E1
Erase and Extend (Easy Version)
|
0 / 0 |
5 |
|
|
32172 |
codeforces#P1537E2
Erase and Extend (Hard Version)
|
0 / 0 |
8 |
|
|
32178 |
codeforces#P1538E
Funny Substrings
|
0 / 0 |
7 |
|
|
32336 |
codeforces#P1569E
Playoff Restoration
|
0 / 0 |
(无) |
|
|
32368 |
codeforces#P1574D
The Strongest Build
|
1 / 11 |
10 |
|
|
32545 |
codeforces#P1610G
AmShZ Wins a Bet
|
1 / 1 |
10 |
|
|
32627 |
codeforces#P1621I
Two Sequences
|
0 / 0 |
10 |
|
|
32633 |
codeforces#P1622F
Quadratic Set
|
1 / 1 |
10 |
