|
7595 |
codeforces#P1624E Masha-forgetful
|
0 / 0 |
(N/A) |
|
7658 |
codeforces#P1634F Fibonacci Additions
|
0 / 0 |
(N/A) |
|
7694 |
codeforces#P1641D Two Arrays
|
2 / 3 |
10 |
|
7716 |
codeforces#P1650C Weight of the System of Nested Segments
|
0 / 0 |
(N/A) |
|
7816 |
codeforces#P1671E Preorder
|
0 / 0 |
(N/A) |
|
7859 |
codeforces#P1673F Anti-Theft Road Planning
|
0 / 0 |
(N/A) |
|
7924 |
codeforces#P1681D Required Length
|
1 / 1 |
10 |
|
8076 |
codeforces#P1704D Magical Array
|
0 / 0 |
(N/A) |
|
8129 |
codeforces#P1721E Prefix Function Queries
|
0 / 0 |
(N/A) |
|
8176 |
codeforces#P1729F Kirei and the Linear Function
|
0 / 0 |
6 |
|
8175 |
codeforces#P1729G Cut Substrings
|
0 / 0 |
7 |
|
8462 |
codeforces#P1731C Even Subarrays
|
0 / 0 |
5 |
|
8216 |
codeforces#P1735D Meta-set
|
0 / 0 |
5 |
|
8265 |
codeforces#P1743D Problem with Random Tests
|
0 / 0 |
5 |
|
8248 |
codeforces#P1746F Kazaee
|
0 / 0 |
10 |
|
8281 |
codeforces#P1753B Factorial Divisibility
|
1 / 1 |
10 |
|
8380 |
codeforces#P1771F Hossam and Range Minimum Query
|
0 / 0 |
(N/A) |
|
8378 |
codeforces#P1773B BinCoin
|
0 / 0 |
8 |
|
8498 |
codeforces#P1792D Fixed Prefix Permutations
|
0 / 0 |
(N/A) |
|
8597 |
codeforces#P1794E Labeling the Tree with Distances
|
0 / 0 |
(N/A) |
|
8577 |
codeforces#P1800D Remove Two Letters
|
0 / 0 |
(N/A) |
|
8574 |
codeforces#P1800F Dasha and Nightmares
|
0 / 0 |
(N/A) |
|
8573 |
codeforces#P1800G Symmetree
|
1 / 7 |
10 |
|
8606 |
codeforces#P1801E Gasoline prices
|
1 / 2 |
10 |
|
8621 |
codeforces#P1806E Tree Master
|
0 / 0 |
(N/A) |
|
8771 |
codeforces#P1827C Palindrome Partition
|
0 / 0 |
(N/A) |
|
8793 |
codeforces#P1830C Hyperregular Bracket Strings
|
0 / 0 |
(N/A) |
|
8799 |
codeforces#P1840E Character Blocking
|
0 / 0 |
(N/A) |
|
8912 |
codeforces#P1849C Binary String Copying
|
0 / 2 |
10 |
|
9029 |
codeforces#P1867F Most Different Tree
|
0 / 0 |
(N/A) |
|
9106 |
codeforces#P1887C Minimum Array
|
1 / 1 |
10 |
|
9132 |
codeforces#P1889C2 Doremy's Drying Plan (Hard Version)
|
0 / 0 |
(N/A) |
|
9140 |
codeforces#P1895C Torn Lucky Ticket
|
2 / 2 |
10 |
|
9209 |
codeforces#P1906B Button Pressing
|
0 / 0 |
10 |
|
9291 |
codeforces#P1909G Pumping Lemma
|
0 / 0 |
10 |
|
9283 |
codeforces#P1913F Palindromic Problem
|
0 / 0 |
10 |
|
9274 |
codeforces#P1914G2 Light Bulbs (Hard Version)
|
0 / 0 |
8 |
|
9470 |
codeforces#P1943B Non-Palindromic Substring
|
0 / 0 |
(N/A) |
|
9497 |
codeforces#P1950G Shuffling Songs
|
0 / 0 |
(N/A) |
|
9527 |
codeforces#P1951E No Palindromes
|
0 / 0 |
(N/A) |
|
9504 |
codeforces#P1952J Help, what does it mean to be "Based"
|
0 / 0 |
(N/A) |
|
9586 |
codeforces#P1957F1 Frequency Mismatch (Easy Version)
|
0 / 0 |
10 |
|
9585 |
codeforces#P1957F2 Frequency Mismatch (Hard Version)
|
0 / 0 |
10 |
|
9562 |
codeforces#P1968G1 Division + LCP (easy version)
|
0 / 0 |
(N/A) |
|
9561 |
codeforces#P1968G2 Division + LCP (hard version)
|
0 / 0 |
(N/A) |
|
3498 |
spoj#ADACLEAN Ada and Spring Cleaning
|
0 / 0 |
(N/A) |
|
3499 |
spoj#ADACLEAN Ada and Spring Cleaning
|
0 / 0 |
(N/A) |
|
3694 |
spoj#ADAPHOTO Ada and Terramorphing
|
0 / 0 |
(N/A) |
|
3959 |
spoj#AHASH Anti Hash
|
0 / 0 |
(N/A) |
|
3927 |
spoj#BPM2 Bipartite Permutation (Hard)
|
0 / 0 |
(N/A) |