|
3094 |
P1166F
Vicky's Delivery Service
|
0 / 0 |
9 |
|
3050 |
P1175F
The Number of Subpermutations
|
0 / 0 |
9 |
|
3015 |
P1182D
Complete Mirror
|
0 / 0 |
9 |
|
2907 |
P1200E
Compress Words
|
0 / 0 |
7 |
|
2865 |
P1207G
Indie Album
|
0 / 0 |
10 |
|
2818 |
P1214D
Treasure Island
|
0 / 0 |
6 |
|
2764 |
P1223F
Stack Exterminable Arrays
|
0 / 0 |
10 |
|
2758 |
P1225D
Power Products
|
0 / 0 |
6 |
|
2742 |
P1228D
Complete Tripartite
|
0 / 0 |
6 |
|
2639 |
P1252F
Regular Forestation
|
0 / 0 |
9 |
|
2606 |
P1257F
Make Them Similar
|
0 / 0 |
9 |
|
2525 |
P1277D
Let's Play the Words?
|
0 / 0 |
6 |
|
2489 |
P1284D
New Year and Conference
|
0 / 0 |
7 |
|
2476 |
P1286C2
Madhouse (Hard version)
|
0 / 0 |
10 |
|
2343 |
P1313E
Concatenation with intersection
|
0 / 0 |
10 |
|
2330 |
P1320D
Reachable Strings
|
0 / 0 |
9 |
|
2323 |
P1322C
Instant Noodles
|
0 / 0 |
8 |
|
2302 |
P1326D1
Prefix-Suffix Palindrome (Easy version)
|
0 / 0 |
5 |
|
2301 |
P1326D2
Prefix-Suffix Palindrome (Hard version)
|
0 / 0 |
6 |
|
2220 |
P1340F
Nastya and CBS
|
0 / 0 |
10 |
|
2098 |
P1360F
Spy-string
|
0 / 0 |
5 |
|
1921 |
P1393E1
Twilight and Ancient Scroll (easier version)
|
0 / 0 |
10 |
|
1920 |
P1393E2
Twilight and Ancient Scroll (harder version)
|
0 / 0 |
10 |
|
1918 |
P1394B
Boboniu Walks on Graph
|
0 / 0 |
8 |
|
1806 |
P1418G
Three Occurrences
|
0 / 0 |
9 |
|
1644 |
P1451C
String Equality
|
0 / 0 |
4 |
|
1578 |
P1466G
Song of the Sirens
|
0 / 0 |
10 |
|
1565 |
P1468F
Full Turn
|
0 / 0 |
5 |
|
1552 |
P1469E
A Bit Similar
|
0 / 0 |
9 |
|
1549 |
P1470B
Strange Definition
|
0 / 0 |
6 |
|
1511 |
P1476E
Pattern Matching
|
0 / 0 |
8 |
|
1509 |
P1476G
Minimum Difference
|
0 / 0 |
10 |
|
1423 |
P1493D
GCD of an Array
|
0 / 0 |
7 |
|
1416 |
P1494E
A-Z Graph
|
0 / 0 |
9 |
|
1386 |
P1500A
Going Home
|
0 / 0 |
6 |
|
1278 |
P1520D
Same Differences
|
0 / 0 |
4 |
|
1244 |
P1527C
Sequence Pair Weight
|
0 / 0 |
5 |
|
1216 |
P1533D
String Searching
|
0 / 0 |
(无) |
|
1195 |
P1535F
String Distance
|
0 / 0 |
10 |
|
1192 |
P1536C
Diluc and Kaeya
|
0 / 0 |
5 |
|
1184 |
P1537E1
Erase and Extend (Easy Version)
|
0 / 0 |
5 |
|
1183 |
P1537E2
Erase and Extend (Hard Version)
|
0 / 0 |
8 |
|
1177 |
P1538E
Funny Substrings
|
0 / 0 |
7 |
|
1100 |
P1553B
Reverse String
|
0 / 0 |
4 |
|
1095 |
P1553G
Common Divisor Graph
|
0 / 0 |
10 |
|
1020 |
P1569E
Playoff Restoration
|
0 / 0 |
10 |
|
1019 |
P1569F
Palindromic Hamiltonian Path
|
0 / 0 |
10 |
|
997 |
P1574D
The Strongest Build
|
0 / 0 |
7 |
|
891 |
P1598G
The Sum of Good Numbers
|
0 / 0 |
10 |
|
885 |
P1599F
Mars
|
0 / 0 |
10 |
|
835 |
P1608G
Alphabetic Tree
|
0 / 0 |
10 |
|
820 |
P1610G
AmShZ Wins a Bet
|
0 / 0 |
10 |
|
738 |
P1621I
Two Sequences
|
0 / 0 |
10 |
|
732 |
P1622F
Quadratic Set
|
0 / 0 |
10 |
|
722 |
P1624E
Masha-forgetful
|
0 / 0 |
7 |
|
667 |
P1634F
Fibonacci Additions
|
0 / 0 |
10 |
|
632 |
P1641D
Two Arrays
|
0 / 0 |
10 |
|
599 |
P1650C
Weight of the System of Nested Segments
|
0 / 0 |
4 |
|
583 |
P1654F
Minimal String Xoration
|
0 / 0 |
10 |
|
560 |
P1658E
Gojou and Matrix Game
|
0 / 0 |
9 |
|
473 |
P1671E
Preorder
|
0 / 0 |
7 |
|
408 |
P1681D
Required Length
|
0 / 0 |
5 |
|
278 |
P1704D
Magical Array
|
0 / 0 |
6 |
|
181 |
P1721E
Prefix Function Queries
|
0 / 0 |
8 |
|
139 |
P1729F
Kirei and the Linear Function
|
0 / 0 |
6 |
|
138 |
P1729G
Cut Substrings
|
0 / 0 |
7 |
|
109 |
P1735D
Meta-set
|
0 / 0 |
5 |
|
50 |
P1743G
Antifibonacci Cut
|
0 / 0 |
10 |
|
36 |
P1746F
Kazaee
|
0 / 0 |
10 |
|
8301 |
P1771F
Hossam and Range Minimum Query
|
0 / 0 |
9 |
|
8299 |
P1773B
BinCoin
|
0 / 0 |
8 |
|
8273 |
P1792D
Fixed Prefix Permutations
|
0 / 0 |
(无) |
|
8403 |
P1794E
Labeling the Tree with Distances
|
0 / 0 |
(无) |
|
8383 |
P1800D
Remove Two Letters
|
0 / 0 |
(无) |
|
8380 |
P1800F
Dasha and Nightmares
|
0 / 0 |
(无) |
|
8379 |
P1800G
Symmetree
|
0 / 0 |
(无) |
|
8435 |
P1801E
Gasoline prices
|
0 / 0 |
10 |
|
8583 |
P1840E
Character Blocking
|
0 / 0 |
5 |
|
8520 |
P1849C
Binary String Copying
|
0 / 0 |
(无) |
|
8683 |
P1867F
Most Different Tree
|
0 / 0 |
10 |
|
8773 |
P1887C
Minimum Array
|
0 / 0 |
(无) |
|
8752 |
P1895C
Torn Lucky Ticket
|
0 / 0 |
(无) |
|
8797 |
P1899D
Yarik and Musical Notes
|
0 / 0 |
4 |
|
8841 |
P1906B
Button Pressing
|
0 / 0 |
10 |
|
8907 |
P1909G
Pumping Lemma
|
0 / 0 |
10 |
|
8877 |
P1913F
Palindromic Problem
|
0 / 0 |
10 |
|
8868 |
P1914G2
Light Bulbs (Hard Version)
|
0 / 0 |
8 |
|
9002 |
P1923F
Shrink-Reverse
|
0 / 0 |
(无) |
|
9043 |
P1943B
Non-Palindromic Substring
|
0 / 0 |
(无) |
|
9031 |
P1948D
Tandem Repeats?
|
0 / 0 |
4 |
|
9126 |
P1950G
Shuffling Songs
|
0 / 0 |
6 |
|
9121 |
P1951E
No Palindromes
|
0 / 0 |
7 |
|
9205 |
P1957F1
Frequency Mismatch (Easy Version)
|
0 / 0 |
10 |
|
9204 |
P1957F2
Frequency Mismatch (Hard Version)
|
0 / 0 |
10 |
|
9181 |
P1968G1
Division + LCP (easy version)
|
0 / 0 |
(无) |
|
9180 |
P1968G2
Division + LCP (hard version)
|
0 / 0 |
(无) |
|
9332 |
P1977D
XORificator
|
0 / 0 |
8 |
|
9321 |
P1979D
Fixing a Binary String
|
0 / 0 |
6 |
|
9314 |
P1980E
Permutation of Rows and Columns
|
0 / 0 |
5 |
|
9287 |
P1984D
"a" String Problem
|
0 / 0 |
7 |