|
3868 |
P1166F
Vicky's Delivery Service
|
0 / 0 |
9 |
|
3824 |
P1175F
The Number of Subpermutations
|
0 / 0 |
9 |
|
3789 |
P1182D
Complete Mirror
|
0 / 0 |
9 |
|
3681 |
P1200E
Compress Words
|
0 / 0 |
7 |
|
3639 |
P1207G
Indie Album
|
0 / 0 |
10 |
|
3592 |
P1214D
Treasure Island
|
0 / 0 |
6 |
|
3538 |
P1223F
Stack Exterminable Arrays
|
0 / 0 |
10 |
|
3532 |
P1225D
Power Products
|
0 / 0 |
6 |
|
3516 |
P1228D
Complete Tripartite
|
0 / 0 |
6 |
|
3413 |
P1252F
Regular Forestation
|
0 / 0 |
9 |
|
3380 |
P1257F
Make Them Similar
|
0 / 0 |
9 |
|
3299 |
P1277D
Let's Play the Words?
|
0 / 0 |
6 |
|
3263 |
P1284D
New Year and Conference
|
0 / 0 |
7 |
|
3250 |
P1286C2
Madhouse (Hard version)
|
0 / 0 |
10 |
|
3117 |
P1313E
Concatenation with intersection
|
0 / 0 |
10 |
|
3104 |
P1320D
Reachable Strings
|
0 / 0 |
9 |
|
3097 |
P1322C
Instant Noodles
|
0 / 0 |
8 |
|
3076 |
P1326D1
Prefix-Suffix Palindrome (Easy version)
|
0 / 0 |
5 |
|
3075 |
P1326D2
Prefix-Suffix Palindrome (Hard version)
|
0 / 0 |
6 |
|
2994 |
P1340F
Nastya and CBS
|
0 / 0 |
10 |
|
2872 |
P1360F
Spy-string
|
0 / 0 |
5 |
|
2695 |
P1393E1
Twilight and Ancient Scroll (easier version)
|
0 / 0 |
10 |
|
2694 |
P1393E2
Twilight and Ancient Scroll (harder version)
|
0 / 0 |
10 |
|
2692 |
P1394B
Boboniu Walks on Graph
|
0 / 0 |
8 |
|
2580 |
P1418G
Three Occurrences
|
0 / 0 |
9 |
|
2418 |
P1451C
String Equality
|
0 / 0 |
4 |
|
2352 |
P1466G
Song of the Sirens
|
0 / 0 |
10 |
|
2339 |
P1468F
Full Turn
|
0 / 0 |
5 |
|
2326 |
P1469E
A Bit Similar
|
0 / 0 |
9 |
|
2323 |
P1470B
Strange Definition
|
0 / 0 |
6 |
|
2285 |
P1476E
Pattern Matching
|
0 / 0 |
8 |
|
2283 |
P1476G
Minimum Difference
|
0 / 0 |
10 |
|
2197 |
P1493D
GCD of an Array
|
0 / 0 |
7 |
|
2190 |
P1494E
A-Z Graph
|
0 / 0 |
9 |
|
2160 |
P1500A
Going Home
|
0 / 0 |
6 |
|
2052 |
P1520D
Same Differences
|
0 / 0 |
4 |
|
2018 |
P1527C
Sequence Pair Weight
|
0 / 0 |
5 |
|
1990 |
P1533D
String Searching
|
0 / 0 |
(无) |
|
1969 |
P1535F
String Distance
|
0 / 0 |
10 |
|
1966 |
P1536C
Diluc and Kaeya
|
0 / 0 |
5 |
|
1958 |
P1537E1
Erase and Extend (Easy Version)
|
0 / 0 |
5 |
|
1957 |
P1537E2
Erase and Extend (Hard Version)
|
0 / 0 |
8 |
|
1951 |
P1538E
Funny Substrings
|
0 / 0 |
7 |
|
1874 |
P1553B
Reverse String
|
0 / 0 |
4 |
|
1869 |
P1553G
Common Divisor Graph
|
0 / 0 |
10 |
|
1794 |
P1569E
Playoff Restoration
|
0 / 0 |
10 |
|
1793 |
P1569F
Palindromic Hamiltonian Path
|
0 / 0 |
10 |
|
1771 |
P1574D
The Strongest Build
|
0 / 0 |
7 |
|
1665 |
P1598G
The Sum of Good Numbers
|
0 / 0 |
10 |
|
1659 |
P1599F
Mars
|
0 / 0 |
10 |
|
1609 |
P1608G
Alphabetic Tree
|
0 / 0 |
10 |
|
1594 |
P1610G
AmShZ Wins a Bet
|
0 / 0 |
10 |
|
1512 |
P1621I
Two Sequences
|
0 / 0 |
10 |
|
1506 |
P1622F
Quadratic Set
|
0 / 0 |
10 |
|
1496 |
P1624E
Masha-forgetful
|
0 / 0 |
7 |
|
1441 |
P1634F
Fibonacci Additions
|
0 / 0 |
10 |
|
1406 |
P1641D
Two Arrays
|
0 / 0 |
10 |
|
1373 |
P1650C
Weight of the System of Nested Segments
|
0 / 0 |
4 |
|
1357 |
P1654F
Minimal String Xoration
|
0 / 0 |
10 |
|
1334 |
P1658E
Gojou and Matrix Game
|
0 / 0 |
9 |
|
1247 |
P1671E
Preorder
|
0 / 0 |
7 |
|
1182 |
P1681D
Required Length
|
0 / 0 |
5 |
|
1052 |
P1704D
Magical Array
|
0 / 0 |
6 |
|
955 |
P1721E
Prefix Function Queries
|
0 / 0 |
8 |
|
913 |
P1729F
Kirei and the Linear Function
|
0 / 0 |
6 |
|
912 |
P1729G
Cut Substrings
|
0 / 0 |
7 |
|
903 |
P1731C
Even Subarrays
|
0 / 0 |
5 |
|
877 |
P1735D
Meta-set
|
0 / 0 |
5 |
|
818 |
P1743G
Antifibonacci Cut
|
0 / 0 |
10 |
|
804 |
P1746F
Kazaee
|
0 / 0 |
10 |
|
672 |
P1771F
Hossam and Range Minimum Query
|
0 / 0 |
9 |
|
670 |
P1773B
BinCoin
|
0 / 0 |
8 |
|
604 |
P1780G
Delicious Dessert
|
0 / 0 |
9 |
|
539 |
P1792D
Fixed Prefix Permutations
|
0 / 0 |
5 |
|
525 |
P1794E
Labeling the Tree with Distances
|
0 / 0 |
9 |
|
486 |
P1800D
Remove Two Letters
|
0 / 0 |
4 |
|
483 |
P1800F
Dasha and Nightmares
|
0 / 0 |
6 |
|
482 |
P1800G
Symmetree
|
0 / 0 |
8 |
|
477 |
P1801E
Gasoline prices
|
0 / 0 |
10 |
|
335 |
P1827C
Palindrome Partition
|
0 / 0 |
10 |
|
319 |
P1830C
Hyperregular Bracket Strings
|
0 / 0 |
9 |
|
264 |
P1840E
Character Blocking
|
0 / 0 |
5 |
|
201 |
P1849C
Binary String Copying
|
0 / 0 |
5 |
|
84 |
P1867F
Most Different Tree
|
0 / 0 |
10 |
|
8981 |
P1889C2
Doremy's Drying Plan (Hard Version)
|
0 / 0 |
(无) |
|
8989 |
P1895C
Torn Lucky Ticket
|
0 / 0 |
4 |
|
9002 |
P1899D
Yarik and Musical Notes
|
0 / 0 |
(无) |
|
9079 |
P1906B
Button Pressing
|
0 / 0 |
10 |
|
9140 |
P1909G
Pumping Lemma
|
0 / 0 |
10 |
|
9033 |
P1913F
Palindromic Problem
|
0 / 0 |
(无) |
|
9107 |
P1914G2
Light Bulbs (Hard Version)
|
0 / 0 |
(无) |
|
9319 |
P1943B
Non-Palindromic Substring
|
0 / 0 |
(无) |
|
9376 |
P1951E
No Palindromes
|
0 / 0 |
(无) |
|
9362 |
P1952J
Help, what does it mean to be "Based"
|
0 / 0 |
(无) |
|
9403 |
P1957F1
Frequency Mismatch (Easy Version)
|
0 / 0 |
(无) |
|
9402 |
P1957F2
Frequency Mismatch (Hard Version)
|
0 / 0 |
(无) |
|
9434 |
P1968G1
Division + LCP (easy version)
|
0 / 0 |
(无) |
|
9433 |
P1968G2
Division + LCP (hard version)
|
0 / 0 |
(无) |
|
9503 |
P1977D
XORificator
|
0 / 0 |
(无) |
|
9529 |
P1979D
Fixing a Binary String
|
0 / 0 |
(无) |