|
|
32643 |
codeforces#P1624E
Masha-forgetful
|
0 / 0 |
(无) |
|
|
32698 |
codeforces#P1634F
Fibonacci Additions
|
0 / 0 |
(无) |
|
|
32733 |
codeforces#P1641D
Two Arrays
|
2 / 3 |
10 |
|
|
32766 |
codeforces#P1650C
Weight of the System of Nested Segments
|
0 / 0 |
(无) |
|
|
32892 |
codeforces#P1671E
Preorder
|
0 / 0 |
(无) |
|
|
32909 |
codeforces#P1673F
Anti-Theft Road Planning
|
0 / 0 |
(无) |
|
|
32957 |
codeforces#P1681D
Required Length
|
1 / 1 |
10 |
|
|
33087 |
codeforces#P1704D
Magical Array
|
0 / 0 |
(无) |
|
|
33184 |
codeforces#P1721E
Prefix Function Queries
|
0 / 0 |
(无) |
|
|
33226 |
codeforces#P1729F
Kirei and the Linear Function
|
0 / 0 |
6 |
|
|
33227 |
codeforces#P1729G
Cut Substrings
|
0 / 0 |
7 |
|
|
33236 |
codeforces#P1731C
Even Subarrays
|
0 / 0 |
5 |
|
|
33262 |
codeforces#P1735D
Meta-set
|
0 / 0 |
5 |
|
|
33318 |
codeforces#P1743D
Problem with Random Tests
|
0 / 0 |
5 |
|
|
33335 |
codeforces#P1746F
Kazaee
|
1 / 1 |
10 |
|
|
33364 |
codeforces#P1753B
Factorial Divisibility
|
1 / 1 |
10 |
|
|
33467 |
codeforces#P1771F
Hossam and Range Minimum Query
|
1 / 2 |
10 |
|
|
33469 |
codeforces#P1773B
BinCoin
|
0 / 0 |
8 |
|
|
33601 |
codeforces#P1792D
Fixed Prefix Permutations
|
0 / 0 |
(无) |
|
|
33615 |
codeforces#P1794E
Labeling the Tree with Distances
|
0 / 0 |
(无) |
|
|
33648 |
codeforces#P1800D
Remove Two Letters
|
0 / 0 |
(无) |
|
|
33651 |
codeforces#P1800F
Dasha and Nightmares
|
0 / 0 |
(无) |
|
|
33652 |
codeforces#P1800G
Symmetree
|
1 / 7 |
10 |
|
|
33657 |
codeforces#P1801E
Gasoline prices
|
1 / 2 |
10 |
|
|
33681 |
codeforces#P1806E
Tree Master
|
0 / 0 |
(无) |
|
|
33799 |
codeforces#P1827C
Palindrome Partition
|
0 / 0 |
(无) |
|
|
33815 |
codeforces#P1830C
Hyperregular Bracket Strings
|
0 / 0 |
(无) |
|
|
33870 |
codeforces#P1840E
Character Blocking
|
0 / 0 |
(无) |
|
|
33933 |
codeforces#P1849C
Binary String Copying
|
0 / 2 |
10 |
|
|
34050 |
codeforces#P1867F
Most Different Tree
|
0 / 0 |
(无) |
|
|
34148 |
codeforces#P1887C
Minimum Array
|
1 / 1 |
10 |
|
|
34155 |
codeforces#P1889C2
Doremy's Drying Plan (Hard Version)
|
0 / 0 |
(无) |
|
|
34176 |
codeforces#P1895C
Torn Lucky Ticket
|
2 / 2 |
10 |
|
|
34242 |
codeforces#P1906B
Button Pressing
|
0 / 0 |
10 |
|
|
34268 |
codeforces#P1909G
Pumping Lemma
|
0 / 0 |
10 |
|
|
34298 |
codeforces#P1913F
Palindromic Problem
|
0 / 0 |
10 |
|
|
34307 |
codeforces#P1914G2
Light Bulbs (Hard Version)
|
0 / 0 |
8 |
|
|
34496 |
codeforces#P1943B
Non-Palindromic Substring
|
0 / 0 |
(无) |
|
|
34543 |
codeforces#P1950G
Shuffling Songs
|
0 / 0 |
(无) |
|
|
34548 |
codeforces#P1951E
No Palindromes
|
0 / 0 |
(无) |
|
|
34562 |
codeforces#P1952J
Help, what does it mean to be "Based"
|
0 / 0 |
(无) |
|
|
34589 |
codeforces#P1957F1
Frequency Mismatch (Easy Version)
|
0 / 0 |
10 |
|
|
34590 |
codeforces#P1957F2
Frequency Mismatch (Hard Version)
|
0 / 0 |
10 |
|
|
34623 |
codeforces#P1968G1
Division + LCP (easy version)
|
0 / 0 |
(无) |
|
|
34624 |
codeforces#P1968G2
Division + LCP (hard version)
|
0 / 0 |
(无) |
|
|
34693 |
codeforces#P1977D
XORificator
|
0 / 0 |
(无) |
|
|
34704 |
codeforces#P1979D
Fixing a Binary String
|
0 / 0 |
(无) |
|
|
34711 |
codeforces#P1980E
Permutation of Rows and Columns
|
0 / 0 |
(无) |
|
|
34738 |
codeforces#P1984D
"a" String Problem
|
0 / 0 |
7 |
|
|
34759 |
codeforces#P1986G2
Permutation Problem (Hard Version)
|
0 / 0 |
(无) |
