|
3915 |
codeforces#P1166F Vicky's Delivery Service
|
0 / 0 |
9 |
|
3871 |
codeforces#P1175F The Number of Subpermutations
|
0 / 0 |
9 |
|
3836 |
codeforces#P1182D Complete Mirror
|
0 / 0 |
9 |
|
3728 |
codeforces#P1200E Compress Words
|
0 / 0 |
7 |
|
3686 |
codeforces#P1207G Indie Album
|
0 / 0 |
10 |
|
3639 |
codeforces#P1214D Treasure Island
|
0 / 0 |
6 |
|
3585 |
codeforces#P1223F Stack Exterminable Arrays
|
0 / 0 |
10 |
|
3579 |
codeforces#P1225D Power Products
|
0 / 0 |
6 |
|
3563 |
codeforces#P1228D Complete Tripartite
|
0 / 0 |
6 |
|
3460 |
codeforces#P1252F Regular Forestation
|
0 / 0 |
9 |
|
3427 |
codeforces#P1257F Make Them Similar
|
0 / 0 |
9 |
|
3346 |
codeforces#P1277D Let's Play the Words?
|
0 / 0 |
6 |
|
3310 |
codeforces#P1284D New Year and Conference
|
0 / 0 |
7 |
|
3297 |
codeforces#P1286C2 Madhouse (Hard version)
|
0 / 0 |
10 |
|
3164 |
codeforces#P1313E Concatenation with intersection
|
0 / 0 |
10 |
|
3151 |
codeforces#P1320D Reachable Strings
|
0 / 0 |
9 |
|
3144 |
codeforces#P1322C Instant Noodles
|
0 / 0 |
8 |
|
3123 |
codeforces#P1326D1 Prefix-Suffix Palindrome (Easy version)
|
0 / 0 |
5 |
|
3122 |
codeforces#P1326D2 Prefix-Suffix Palindrome (Hard version)
|
0 / 0 |
6 |
|
3041 |
codeforces#P1340F Nastya and CBS
|
0 / 0 |
10 |
|
2919 |
codeforces#P1360F Spy-string
|
0 / 0 |
5 |
|
2742 |
codeforces#P1393E1 Twilight and Ancient Scroll (easier version)
|
0 / 0 |
10 |
|
2741 |
codeforces#P1393E2 Twilight and Ancient Scroll (harder version)
|
0 / 0 |
10 |
|
2739 |
codeforces#P1394B Boboniu Walks on Graph
|
0 / 0 |
8 |
|
2627 |
codeforces#P1418G Three Occurrences
|
0 / 0 |
9 |
|
2465 |
codeforces#P1451C String Equality
|
0 / 0 |
4 |
|
2399 |
codeforces#P1466G Song of the Sirens
|
0 / 0 |
10 |
|
2386 |
codeforces#P1468F Full Turn
|
0 / 0 |
5 |
|
2373 |
codeforces#P1469E A Bit Similar
|
0 / 0 |
9 |
|
2370 |
codeforces#P1470B Strange Definition
|
0 / 0 |
6 |
|
2332 |
codeforces#P1476E Pattern Matching
|
0 / 0 |
8 |
|
2330 |
codeforces#P1476G Minimum Difference
|
0 / 0 |
10 |
|
2244 |
codeforces#P1493D GCD of an Array
|
0 / 0 |
7 |
|
2237 |
codeforces#P1494E A-Z Graph
|
0 / 0 |
9 |
|
2207 |
codeforces#P1500A Going Home
|
0 / 0 |
6 |
|
2099 |
codeforces#P1520D Same Differences
|
0 / 0 |
4 |
|
2065 |
codeforces#P1527C Sequence Pair Weight
|
0 / 0 |
5 |
|
2037 |
codeforces#P1533D String Searching
|
0 / 0 |
(None) |
|
2016 |
codeforces#P1535F String Distance
|
0 / 0 |
10 |
|
2013 |
codeforces#P1536C Diluc and Kaeya
|
0 / 0 |
5 |
|
2005 |
codeforces#P1537E1 Erase and Extend (Easy Version)
|
0 / 0 |
5 |
|
2004 |
codeforces#P1537E2 Erase and Extend (Hard Version)
|
0 / 0 |
8 |
|
1998 |
codeforces#P1538E Funny Substrings
|
0 / 0 |
7 |
|
1921 |
codeforces#P1553B Reverse String
|
0 / 0 |
4 |
|
1916 |
codeforces#P1553G Common Divisor Graph
|
0 / 0 |
10 |
|
1841 |
codeforces#P1569E Playoff Restoration
|
0 / 0 |
10 |
|
1840 |
codeforces#P1569F Palindromic Hamiltonian Path
|
0 / 0 |
10 |
|
1818 |
codeforces#P1574D The Strongest Build
|
0 / 0 |
7 |
|
1712 |
codeforces#P1598G The Sum of Good Numbers
|
0 / 0 |
10 |
|
1706 |
codeforces#P1599F Mars
|
0 / 0 |
10 |
|
1656 |
codeforces#P1608G Alphabetic Tree
|
0 / 0 |
10 |
|
1641 |
codeforces#P1610G AmShZ Wins a Bet
|
0 / 0 |
10 |
|
1559 |
codeforces#P1621I Two Sequences
|
0 / 0 |
10 |
|
1553 |
codeforces#P1622F Quadratic Set
|
0 / 0 |
10 |
|
1543 |
codeforces#P1624E Masha-forgetful
|
0 / 0 |
7 |
|
1488 |
codeforces#P1634F Fibonacci Additions
|
0 / 0 |
10 |
|
1453 |
codeforces#P1641D Two Arrays
|
0 / 0 |
10 |
|
1420 |
codeforces#P1650C Weight of the System of Nested Segments
|
0 / 0 |
4 |
|
1404 |
codeforces#P1654F Minimal String Xoration
|
0 / 0 |
10 |
|
1381 |
codeforces#P1658E Gojou and Matrix Game
|
0 / 0 |
9 |
|
1294 |
codeforces#P1671E Preorder
|
0 / 0 |
7 |
|
1229 |
codeforces#P1681D Required Length
|
0 / 0 |
5 |
|
1099 |
codeforces#P1704D Magical Array
|
0 / 0 |
6 |
|
1002 |
codeforces#P1721E Prefix Function Queries
|
0 / 0 |
8 |
|
960 |
codeforces#P1729F Kirei and the Linear Function
|
0 / 0 |
6 |
|
959 |
codeforces#P1729G Cut Substrings
|
0 / 0 |
7 |
|
950 |
codeforces#P1731C Even Subarrays
|
0 / 0 |
5 |
|
924 |
codeforces#P1735D Meta-set
|
0 / 0 |
5 |
|
865 |
codeforces#P1743G Antifibonacci Cut
|
0 / 0 |
10 |
|
851 |
codeforces#P1746F Kazaee
|
0 / 0 |
10 |
|
719 |
codeforces#P1771F Hossam and Range Minimum Query
|
0 / 0 |
9 |
|
717 |
codeforces#P1773B BinCoin
|
0 / 0 |
8 |
|
651 |
codeforces#P1780G Delicious Dessert
|
0 / 0 |
9 |
|
586 |
codeforces#P1792D Fixed Prefix Permutations
|
0 / 0 |
5 |
|
572 |
codeforces#P1794E Labeling the Tree with Distances
|
0 / 0 |
9 |
|
533 |
codeforces#P1800D Remove Two Letters
|
0 / 0 |
4 |
|
530 |
codeforces#P1800F Dasha and Nightmares
|
0 / 0 |
6 |
|
529 |
codeforces#P1800G Symmetree
|
0 / 0 |
8 |
|
524 |
codeforces#P1801E Gasoline prices
|
0 / 0 |
10 |
|
382 |
codeforces#P1827C Palindrome Partition
|
0 / 0 |
10 |
|
366 |
codeforces#P1830C Hyperregular Bracket Strings
|
0 / 0 |
9 |
|
311 |
codeforces#P1840E Character Blocking
|
0 / 0 |
5 |
|
248 |
codeforces#P1849C Binary String Copying
|
0 / 0 |
5 |
|
131 |
codeforces#P1867F Most Different Tree
|
0 / 0 |
10 |
|
33 |
codeforces#P1887C Minimum Array
|
0 / 0 |
9 |
|
5 |
codeforces#P1895C Torn Lucky Ticket
|
0 / 0 |
4 |
|
6618 |
codeforces#P1906B Button Pressing
|
0 / 0 |
10 |
|
6690 |
codeforces#P1909G Pumping Lemma
|
0 / 0 |
10 |
|
6660 |
codeforces#P1913F Palindromic Problem
|
0 / 0 |
10 |
|
6651 |
codeforces#P1914G2 Light Bulbs (Hard Version)
|
0 / 0 |
8 |
|
8925 |
codeforces#P1923F Shrink-Reverse
|
0 / 0 |
(None) |
|
9389 |
codeforces#P1957F1 Frequency Mismatch (Easy Version)
|
0 / 0 |
10 |
|
9388 |
codeforces#P1957F2 Frequency Mismatch (Hard Version)
|
0 / 0 |
10 |
|
9355 |
codeforces#P1968G1 Division + LCP (easy version)
|
0 / 0 |
6 |
|
9354 |
codeforces#P1968G2 Division + LCP (hard version)
|
0 / 0 |
8 |
|
9348 |
codeforces#P1969F Card Pairing
|
0 / 0 |
10 |
|
9291 |
codeforces#P1977D XORificator
|
0 / 0 |
(None) |
|
3485 |
spoj#ADACLEAN Ada and Spring Cleaning
|
0 / 0 |
(None) |
|
3646 |
spoj#ADAPHOTO Ada and Terramorphing
|
0 / 0 |
(None) |
|
3910 |
spoj#AHASH Anti Hash
|
0 / 0 |
(None) |