|
3375 |
P1166F
Vicky's Delivery Service
|
0 / 0 |
9 |
|
3331 |
P1175F
The Number of Subpermutations
|
0 / 0 |
9 |
|
3296 |
P1182D
Complete Mirror
|
0 / 0 |
9 |
|
3188 |
P1200E
Compress Words
|
0 / 0 |
7 |
|
3146 |
P1207G
Indie Album
|
0 / 0 |
10 |
|
3099 |
P1214D
Treasure Island
|
0 / 0 |
6 |
|
3045 |
P1223F
Stack Exterminable Arrays
|
0 / 0 |
10 |
|
3039 |
P1225D
Power Products
|
0 / 0 |
6 |
|
3023 |
P1228D
Complete Tripartite
|
0 / 0 |
6 |
|
2920 |
P1252F
Regular Forestation
|
0 / 0 |
9 |
|
2887 |
P1257F
Make Them Similar
|
0 / 0 |
9 |
|
2806 |
P1277D
Let's Play the Words?
|
0 / 0 |
6 |
|
2770 |
P1284D
New Year and Conference
|
0 / 0 |
7 |
|
2757 |
P1286C2
Madhouse (Hard version)
|
0 / 0 |
10 |
|
2624 |
P1313E
Concatenation with intersection
|
0 / 0 |
10 |
|
2611 |
P1320D
Reachable Strings
|
0 / 0 |
9 |
|
2604 |
P1322C
Instant Noodles
|
0 / 0 |
8 |
|
2583 |
P1326D1
Prefix-Suffix Palindrome (Easy version)
|
0 / 0 |
5 |
|
2582 |
P1326D2
Prefix-Suffix Palindrome (Hard version)
|
0 / 0 |
6 |
|
2501 |
P1340F
Nastya and CBS
|
0 / 0 |
10 |
|
2379 |
P1360F
Spy-string
|
0 / 0 |
5 |
|
2202 |
P1393E1
Twilight and Ancient Scroll (easier version)
|
0 / 0 |
10 |
|
2201 |
P1393E2
Twilight and Ancient Scroll (harder version)
|
0 / 0 |
10 |
|
2199 |
P1394B
Boboniu Walks on Graph
|
0 / 0 |
8 |
|
2087 |
P1418G
Three Occurrences
|
0 / 0 |
9 |
|
1925 |
P1451C
String Equality
|
0 / 0 |
4 |
|
1859 |
P1466G
Song of the Sirens
|
0 / 0 |
10 |
|
1846 |
P1468F
Full Turn
|
0 / 0 |
5 |
|
1833 |
P1469E
A Bit Similar
|
0 / 0 |
9 |
|
1830 |
P1470B
Strange Definition
|
0 / 0 |
6 |
|
1792 |
P1476E
Pattern Matching
|
0 / 0 |
8 |
|
1790 |
P1476G
Minimum Difference
|
0 / 0 |
10 |
|
1704 |
P1493D
GCD of an Array
|
0 / 0 |
7 |
|
1697 |
P1494E
A-Z Graph
|
0 / 0 |
9 |
|
1667 |
P1500A
Going Home
|
0 / 0 |
6 |
|
1559 |
P1520D
Same Differences
|
0 / 0 |
4 |
|
1525 |
P1527C
Sequence Pair Weight
|
0 / 0 |
5 |
|
1497 |
P1533D
String Searching
|
0 / 0 |
(无) |
|
1476 |
P1535F
String Distance
|
0 / 0 |
10 |
|
1473 |
P1536C
Diluc and Kaeya
|
0 / 0 |
5 |
|
1465 |
P1537E1
Erase and Extend (Easy Version)
|
0 / 0 |
5 |
|
1464 |
P1537E2
Erase and Extend (Hard Version)
|
0 / 0 |
8 |
|
1458 |
P1538E
Funny Substrings
|
0 / 0 |
7 |
|
1381 |
P1553B
Reverse String
|
0 / 0 |
4 |
|
1376 |
P1553G
Common Divisor Graph
|
0 / 0 |
10 |
|
1301 |
P1569E
Playoff Restoration
|
0 / 0 |
10 |
|
1300 |
P1569F
Palindromic Hamiltonian Path
|
0 / 0 |
10 |
|
1278 |
P1574D
The Strongest Build
|
0 / 0 |
7 |
|
1172 |
P1598G
The Sum of Good Numbers
|
0 / 0 |
10 |
|
1166 |
P1599F
Mars
|
0 / 0 |
10 |
|
1116 |
P1608G
Alphabetic Tree
|
0 / 0 |
10 |
|
1101 |
P1610G
AmShZ Wins a Bet
|
0 / 0 |
10 |
|
1019 |
P1621I
Two Sequences
|
0 / 0 |
10 |
|
1013 |
P1622F
Quadratic Set
|
0 / 0 |
10 |
|
1003 |
P1624E
Masha-forgetful
|
0 / 0 |
7 |
|
948 |
P1634F
Fibonacci Additions
|
0 / 0 |
10 |
|
913 |
P1641D
Two Arrays
|
0 / 0 |
10 |
|
880 |
P1650C
Weight of the System of Nested Segments
|
0 / 0 |
4 |
|
864 |
P1654F
Minimal String Xoration
|
0 / 0 |
10 |
|
841 |
P1658E
Gojou and Matrix Game
|
0 / 0 |
9 |
|
754 |
P1671E
Preorder
|
0 / 0 |
7 |
|
689 |
P1681D
Required Length
|
0 / 0 |
5 |
|
559 |
P1704D
Magical Array
|
0 / 0 |
6 |
|
462 |
P1721E
Prefix Function Queries
|
0 / 0 |
8 |
|
420 |
P1729F
Kirei and the Linear Function
|
0 / 0 |
6 |
|
419 |
P1729G
Cut Substrings
|
0 / 0 |
7 |
|
410 |
P1731C
Even Subarrays
|
0 / 0 |
5 |
|
384 |
P1735D
Meta-set
|
0 / 0 |
5 |
|
325 |
P1743G
Antifibonacci Cut
|
0 / 0 |
10 |
|
311 |
P1746F
Kazaee
|
0 / 0 |
10 |
|
179 |
P1771F
Hossam and Range Minimum Query
|
0 / 0 |
9 |
|
177 |
P1773B
BinCoin
|
0 / 0 |
8 |
|
111 |
P1780G
Delicious Dessert
|
0 / 0 |
9 |
|
46 |
P1792D
Fixed Prefix Permutations
|
0 / 0 |
5 |
|
32 |
P1794E
Labeling the Tree with Distances
|
0 / 0 |
(无) |
|
5 |
P1800D
Remove Two Letters
|
0 / 0 |
(无) |
|
2 |
P1800F
Dasha and Nightmares
|
0 / 0 |
(无) |
|
1 |
P1800G
Symmetree
|
0 / 0 |
(无) |
|
3776 |
P1801E
Gasoline prices
|
0 / 0 |
(无) |
|
8635 |
P1827C
Palindrome Partition
|
0 / 0 |
10 |
|
8619 |
P1830C
Hyperregular Bracket Strings
|
0 / 0 |
(无) |
|
8669 |
P1840E
Character Blocking
|
0 / 0 |
5 |
|
8772 |
P1849C
Binary String Copying
|
0 / 0 |
(无) |
|
8891 |
P1867F
Most Different Tree
|
0 / 0 |
(无) |
|
8901 |
P1887C
Minimum Array
|
0 / 0 |
(无) |
|
8971 |
P1895C
Torn Lucky Ticket
|
0 / 0 |
(无) |
|
8968 |
P1895F
Fancy Arrays
|
0 / 0 |
(无) |
|
9044 |
P1899D
Yarik and Musical Notes
|
0 / 0 |
4 |
|
9007 |
P1906B
Button Pressing
|
0 / 0 |
10 |
|
9115 |
P1909G
Pumping Lemma
|
0 / 0 |
10 |
|
9085 |
P1913F
Palindromic Problem
|
0 / 0 |
10 |
|
9076 |
P1914G2
Light Bulbs (Hard Version)
|
0 / 0 |
8 |
|
9303 |
P1943B
Non-Palindromic Substring
|
0 / 0 |
(无) |
|
9291 |
P1948D
Tandem Repeats?
|
0 / 0 |
(无) |
|
9366 |
P1950G
Shuffling Songs
|
0 / 0 |
6 |
|
9361 |
P1951E
No Palindromes
|
0 / 0 |
7 |
|
9394 |
P1957F1
Frequency Mismatch (Easy Version)
|
0 / 0 |
(无) |
|
9393 |
P1957F2
Frequency Mismatch (Hard Version)
|
0 / 0 |
(无) |
|
9438 |
P1968G1
Division + LCP (easy version)
|
0 / 0 |
6 |
|
9437 |
P1968G2
Division + LCP (hard version)
|
0 / 0 |
8 |