|
|
29673 |
codeforces#P1063F
String Journey
|
1 / 14 |
10 |
|
|
29717 |
codeforces#P1073G
Yet Another LCP Problem
|
0 / 0 |
10 |
|
|
29853 |
codeforces#P1098F
Ж-function
|
0 / 0 |
10 |
|
|
29990 |
codeforces#P1129C
Morse Code
|
0 / 0 |
9 |
|
|
30369 |
codeforces#P1200E
Compress Words
|
2 / 8 |
7 |
|
|
30381 |
codeforces#P1202E
You Are Given Some Strings...
|
0 / 0 |
9 |
|
|
30411 |
codeforces#P1207G
Indie Album
|
0 / 0 |
10 |
|
|
30703 |
codeforces#P1266G
Permutation Concatenation
|
0 / 0 |
10 |
|
|
30759 |
codeforces#P1276F
Asterisk Substrings
|
0 / 0 |
10 |
|
|
30986 |
codeforces#P1326D1
Prefix-Suffix Palindrome (Easy version)
|
0 / 0 |
5 |
|
|
30987 |
codeforces#P1326D2
Prefix-Suffix Palindrome (Hard version)
|
0 / 0 |
6 |
|
|
30998 |
codeforces#P1327G
Letters and Question Marks
|
0 / 0 |
10 |
|
|
31337 |
codeforces#P1387C
Viruses
|
0 / 0 |
10 |
|
|
31368 |
codeforces#P1393E1
Twilight and Ancient Scroll (easier version)
|
0 / 0 |
10 |
|
|
31369 |
codeforces#P1393E2
Twilight and Ancient Scroll (harder version)
|
0 / 0 |
10 |
|
|
31404 |
codeforces#P1400F
x-prime Substrings
|
0 / 0 |
10 |
|
|
31592 |
codeforces#P1437G
Death DBMS
|
0 / 0 |
10 |
|
|
31711 |
codeforces#P1466G
Song of the Sirens
|
0 / 0 |
10 |
|
|
31737 |
codeforces#P1469E
A Bit Similar
|
0 / 0 |
9 |
|
|
31811 |
codeforces#P1482H
Exam
|
0 / 0 |
10 |
|
|
31960 |
codeforces#P1511F
Chainword
|
0 / 0 |
10 |
|
|
32166 |
codeforces#P1536F
Omkar and Akmar
|
0 / 0 |
10 |
|
|
32171 |
codeforces#P1537E1
Erase and Extend (Easy Version)
|
0 / 0 |
5 |
|
|
32172 |
codeforces#P1537E2
Erase and Extend (Hard Version)
|
0 / 0 |
8 |
|
|
32315 |
codeforces#P1562E
Rescue Niwen!
|
1 / 1 |
10 |
|
|
32627 |
codeforces#P1621I
Two Sequences
|
0 / 0 |
10 |
|
|
32778 |
codeforces#P1654B
Prefix Removals
|
0 / 0 |
3 |
|
|
33184 |
codeforces#P1721E
Prefix Function Queries
|
0 / 0 |
(无) |
|
|
33291 |
codeforces#P1739F
Keyboard Design
|
0 / 0 |
(无) |
|
|
33317 |
codeforces#P1743C
Save the Magazines
|
0 / 0 |
3 |
|
|
33536 |
codeforces#P1780G
Delicious Dessert
|
0 / 0 |
(无) |
|
|
33659 |
codeforces#P1801G
A task for substrings
|
0 / 0 |
(无) |
|
|
33751 |
codeforces#P1817F
Entangled Substrings
|
0 / 0 |
10 |
|
|
34194 |
codeforces#P1898E
Sofia and Strings
|
1 / 1 |
10 |
|
|
34298 |
codeforces#P1913F
Palindromic Problem
|
0 / 0 |
10 |
|
|
34371 |
codeforces#P1923F
Shrink-Reverse
|
0 / 0 |
(无) |
|
|
34562 |
codeforces#P1952J
Help, what does it mean to be "Based"
|
0 / 0 |
(无) |
|
|
34623 |
codeforces#P1968G1
Division + LCP (easy version)
|
0 / 0 |
(无) |
|
|
34624 |
codeforces#P1968G2
Division + LCP (hard version)
|
0 / 0 |
(无) |
|
|
34738 |
codeforces#P1984D
"a" String Problem
|
0 / 0 |
7 |
