|
42 |
codeforces#P1884D Counting Rhyme
|
0 / 0 |
7 |
|
36 |
codeforces#P1886E I Wanna be the Team Leader
|
0 / 0 |
9 |
|
27 |
codeforces#P1889C1 Doremy's Drying Plan (Easy Version)
|
0 / 0 |
7 |
|
26 |
codeforces#P1889C2 Doremy's Drying Plan (Hard Version)
|
0 / 0 |
10 |
|
23 |
codeforces#P1889F Doremy's Average Tree
|
0 / 0 |
10 |
|
10 |
codeforces#P1893E Cacti Symphony
|
0 / 0 |
10 |
|
5 |
codeforces#P1895C Torn Lucky Ticket
|
0 / 0 |
4 |
|
3 |
codeforces#P1895E Infinite Card Game
|
0 / 0 |
8 |
|
2 |
codeforces#P1895F Fancy Arrays
|
0 / 0 |
10 |
|
1 |
codeforces#P1895G Two Characters, Two Colors
|
0 / 0 |
10 |
|
5141 |
codeforces#P1896H1 Cyclic Hamming (Easy Version)
|
0 / 0 |
(None) |
|
5140 |
codeforces#P1896H2 Cyclic Hamming (Hard Version)
|
0 / 0 |
(None) |
|
5069 |
codeforces#P1899C Yarik and Array
|
0 / 0 |
(None) |
|
5348 |
codeforces#P1900B Laura and Operations
|
0 / 0 |
3 |
|
5347 |
codeforces#P1900C Anji's Binary Tree
|
0 / 0 |
4 |
|
5346 |
codeforces#P1900D Small GCD
|
0 / 0 |
7 |
|
5345 |
codeforces#P1900E Transitive Graph
|
0 / 0 |
7 |
|
5136 |
codeforces#P1901D Yet Another Monster Fight
|
0 / 0 |
5 |
|
5135 |
codeforces#P1901E Compressed Tree
|
0 / 0 |
8 |
|
6622 |
codeforces#P1902D Robot Queries
|
0 / 0 |
6 |
|
5341 |
codeforces#P1903C Theofanis' Nightmare
|
0 / 0 |
4 |
|
5339 |
codeforces#P1903D2 Maximum And Queries (hard version)
|
0 / 0 |
9 |
|
5338 |
codeforces#P1903E Geo Game
|
0 / 0 |
7 |
|
6709 |
codeforces#P1904B Collecting Game
|
0 / 0 |
3 |
|
6699 |
codeforces#P1905E One-X
|
0 / 0 |
9 |
|
6615 |
codeforces#P1906E Merge Not Sort
|
0 / 0 |
6 |
|
6612 |
codeforces#P1906H Twin Friends
|
0 / 0 |
8 |
|
6610 |
codeforces#P1906J Count BFS Graph
|
0 / 0 |
7 |
|
6692 |
codeforces#P1909F1 Small Permutation Problem (Easy Version)
|
0 / 0 |
8 |
|
6691 |
codeforces#P1909F2 Small Permutation Problem (Hard Version)
|
0 / 0 |
9 |
|
6688 |
codeforces#P1909I Short Permutation Problem
|
0 / 0 |
10 |
|
6683 |
codeforces#P1910E Maximum Sum Subarrays
|
0 / 0 |
7 |
|
6679 |
codeforces#P1910I Inverse Problem
|
0 / 0 |
10 |
|
6667 |
codeforces#P1912K Kim's Quest
|
0 / 0 |
6 |
|
6662 |
codeforces#P1913D Array Collapse
|
0 / 0 |
7 |
|
6656 |
codeforces#P1914D Three Activities
|
0 / 0 |
4 |
|
6653 |
codeforces#P1914F Programming Competition
|
0 / 0 |
6 |
|
6652 |
codeforces#P1914G1 Light Bulbs (Easy Version)
|
0 / 0 |
7 |
|
6651 |
codeforces#P1914G2 Light Bulbs (Hard Version)
|
0 / 0 |
8 |
|
6637 |
codeforces#P1916G Optimizations From Chelsu
|
0 / 0 |
10 |
|
6636 |
codeforces#P1916H1 Matrix Rank (Easy Version)
|
0 / 0 |
10 |
|
6635 |
codeforces#P1916H2 Matrix Rank (Hard Version)
|
0 / 0 |
10 |
|
6633 |
codeforces#P1917B Erase First or Second Letter
|
0 / 0 |
3 |
|
6631 |
codeforces#P1917D Yet Another Inversions Problem
|
0 / 0 |
8 |
|
6629 |
codeforces#P1917F Construct Tree
|
0 / 0 |
9 |
|
8205 |
codeforces#P1918C XOR-distance
|
0 / 0 |
4 |
|
8204 |
codeforces#P1918D Blocking Elements
|
0 / 0 |
6 |
|
8202 |
codeforces#P1918F Caterpillar on a Tree
|
0 / 0 |
9 |
|
7323 |
codeforces#P1919C Grouping Increases
|
0 / 0 |
4 |
|
7322 |
codeforces#P1919D 01 Tree
|
0 / 0 |
7 |
|
7321 |
codeforces#P1919E Counting Prefixes
|
0 / 0 |
10 |
|
7319 |
codeforces#P1919F2 Wine Factory (Hard Version)
|
0 / 0 |
10 |
|
8196 |
codeforces#P1920E Counting Binary Strings
|
0 / 0 |
7 |
|
8188 |
codeforces#P1921F Sum of Progression
|
0 / 0 |
6 |
|
8187 |
codeforces#P1921G Mischievous Shooter
|
0 / 0 |
8 |
|
8181 |
codeforces#P1922F Replace on Segment
|
0 / 0 |
9 |
|
8929 |
codeforces#P1923B Monsters Attack!
|
0 / 0 |
(None) |
|
8926 |
codeforces#P1923E Count Paths
|
0 / 0 |
(None) |
|
8180 |
codeforces#P1924A Did We Get Everything Covered?
|
0 / 0 |
5 |
|
8177 |
codeforces#P1924D Balanced Subsequences
|
0 / 0 |
10 |
|
8175 |
codeforces#P1924F Anti-Proxy Attendance
|
0 / 0 |
10 |
|
8172 |
codeforces#P1925D Good Trip
|
0 / 0 |
6 |
|
8922 |
codeforces#P1926C Vlad and a Sum of Sum of Digits
|
0 / 0 |
(None) |
|
8920 |
codeforces#P1926E Vlad and an Odd Ordering
|
0 / 0 |
(None) |
|
8919 |
codeforces#P1926F Vlad and Avoiding X
|
0 / 0 |
(None) |
|
8918 |
codeforces#P1926G Vlad and Trouble at MIT
|
0 / 0 |
(None) |
|
8914 |
codeforces#P1927D Find the Different Ones!
|
0 / 0 |
4 |
|
8911 |
codeforces#P1927G Paint Charges
|
0 / 0 |
8 |
|
8906 |
codeforces#P1928E Modular Sequence
|
0 / 0 |
8 |
|
8901 |
codeforces#P1929D Sasha and a Walk in the City
|
0 / 0 |
6 |
|
8900 |
codeforces#P1929E Sasha and the Happy Tree Cutting
|
0 / 0 |
8 |
|
8895 |
codeforces#P1930D1 Sum over all Substrings (Easy Version)
|
0 / 0 |
(None) |
|
8894 |
codeforces#P1930D2 Sum over all Substrings (Hard Version)
|
0 / 0 |
(None) |
|
8893 |
codeforces#P1930E 2..3...4...
|
0 / 0 |
(None) |
|
8891 |
codeforces#P1930G Prefix Max Set Counting
|
0 / 0 |
(None) |
|
8881 |
codeforces#P1932A Thorns and Coins
|
0 / 0 |
(None) |
|
8876 |
codeforces#P1932F Feed Cats
|
0 / 0 |
(None) |
|
8869 |
codeforces#P1933F Turtle Mission: Robot and the Earthquake
|
0 / 0 |
(None) |
|
8866 |
codeforces#P1934B Yet Another Coin Problem
|
0 / 0 |
(None) |
|
8859 |
codeforces#P1935C Messenger in MAC
|
0 / 0 |
(None) |
|
8848 |
codeforces#P1937B Binary Path
|
0 / 0 |
(None) |
|
9387 |
codeforces#P1958A 1-3-5
|
0 / 0 |
3 |
|
9380 |
codeforces#P1958H Composite Spells
|
0 / 0 |
10 |
|
9366 |
codeforces#P1967C Fenwick Tree
|
0 / 0 |
8 |
|
9364 |
codeforces#P1967E1 Again Counting Arrays (Easy Version)
|
0 / 0 |
10 |
|
9363 |
codeforces#P1967E2 Again Counting Arrays (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 |
|
9351 |
codeforces#P1969C Minimizing the Sum
|
0 / 0 |
5 |
|
9349 |
codeforces#P1969E Unique Array
|
0 / 0 |
9 |
|
9348 |
codeforces#P1969F Card Pairing
|
0 / 0 |
10 |
|
9340 |
codeforces#P1970C2 Game on Tree (Medium)
|
0 / 0 |
5 |
|
9339 |
codeforces#P1970C3 Game on Tree (Hard)
|
0 / 0 |
6 |
|
9335 |
codeforces#P1970E1 Trails (Easy)
|
0 / 0 |
6 |
|
9334 |
codeforces#P1970E2 Trails (Medium)
|
0 / 0 |
7 |
|
9333 |
codeforces#P1970E3 Trails (Hard)
|
0 / 0 |
8 |
|
9328 |
codeforces#P1970G2 Min-Fund Prison (Medium)
|
0 / 0 |
8 |
|
9327 |
codeforces#P1970G3 Min-Fund Prison (Hard)
|
0 / 0 |
9 |
|
9323 |
codeforces#P1971D Binary Cut
|
0 / 0 |
3 |
|
9316 |
codeforces#P1973A Chess For Three
|
0 / 0 |
3 |