|
|
9129 |
codeforces#P1889F Doremy's Average Tree
|
0 / 0 |
(无) |
|
|
9145 |
codeforces#P1893E Cacti Symphony
|
0 / 0 |
10 |
|
|
9140 |
codeforces#P1895C Torn Lucky Ticket
|
2 / 2 |
10 |
|
|
9137 |
codeforces#P1895F Fancy Arrays
|
0 / 0 |
(无) |
|
|
9136 |
codeforces#P1895G Two Characters, Two Colors
|
0 / 0 |
(无) |
|
|
9176 |
codeforces#P1896H1 Cyclic Hamming (Easy Version)
|
0 / 0 |
(无) |
|
|
9175 |
codeforces#P1896H2 Cyclic Hamming (Hard Version)
|
0 / 0 |
(无) |
|
|
9173 |
codeforces#P1900B Laura and Operations
|
0 / 0 |
(无) |
|
|
9172 |
codeforces#P1900C Anji's Binary Tree
|
0 / 0 |
(无) |
|
|
9171 |
codeforces#P1900D Small GCD
|
0 / 0 |
(无) |
|
|
9170 |
codeforces#P1900E Transitive Graph
|
0 / 0 |
(无) |
|
|
9165 |
codeforces#P1901D Yet Another Monster Fight
|
0 / 0 |
(无) |
|
|
9164 |
codeforces#P1901E Compressed Tree
|
0 / 0 |
(无) |
|
|
9213 |
codeforces#P1902D Robot Queries
|
0 / 0 |
6 |
|
|
9188 |
codeforces#P1903C Theofanis' Nightmare
|
0 / 0 |
(无) |
|
|
9186 |
codeforces#P1903D2 Maximum And Queries (hard version)
|
0 / 0 |
(无) |
|
|
9185 |
codeforces#P1903E Geo Game
|
0 / 0 |
(无) |
|
|
9244 |
codeforces#P1904B Collecting Game
|
0 / 0 |
(无) |
|
|
9247 |
codeforces#P1905E One-X
|
0 / 0 |
(无) |
|
|
9206 |
codeforces#P1906E Merge Not Sort
|
0 / 0 |
6 |
|
|
9203 |
codeforces#P1906H Twin Friends
|
0 / 0 |
8 |
|
|
9201 |
codeforces#P1906J Count BFS Graph
|
0 / 0 |
7 |
|
|
9293 |
codeforces#P1909F1 Small Permutation Problem (Easy Version)
|
0 / 0 |
8 |
|
|
9292 |
codeforces#P1909F2 Small Permutation Problem (Hard Version)
|
0 / 0 |
9 |
|
|
9289 |
codeforces#P1909I Short Permutation Problem
|
0 / 0 |
10 |
|
|
9234 |
codeforces#P1910E Maximum Sum Subarrays
|
0 / 0 |
7 |
|
|
9230 |
codeforces#P1910I Inverse Problem
|
0 / 0 |
10 |
|
|
9218 |
codeforces#P1912K Kim's Quest
|
0 / 0 |
6 |
|
|
9285 |
codeforces#P1913D Array Collapse
|
0 / 0 |
7 |
|
|
9279 |
codeforces#P1914D Three Activities
|
0 / 0 |
4 |
|
|
9276 |
codeforces#P1914F Programming Competition
|
0 / 0 |
6 |
|
|
9275 |
codeforces#P1914G1 Light Bulbs (Easy Version)
|
0 / 0 |
7 |
|
|
9274 |
codeforces#P1914G2 Light Bulbs (Hard Version)
|
0 / 0 |
8 |
|
|
9260 |
codeforces#P1916G Optimizations From Chelsu
|
0 / 0 |
10 |
|
|
9259 |
codeforces#P1916H1 Matrix Rank (Easy Version)
|
1 / 1 |
10 |
|
|
9258 |
codeforces#P1916H2 Matrix Rank (Hard Version)
|
1 / 1 |
10 |
|
|
9256 |
codeforces#P1917B Erase First or Second Letter
|
1 / 1 |
3 |
|
|
9254 |
codeforces#P1917D Yet Another Inversions Problem
|
1 / 2 |
8 |
|
|
9252 |
codeforces#P1917F Construct Tree
|
1 / 6 |
9 |
|
|
9341 |
codeforces#P1918C XOR-distance
|
1 / 1 |
10 |
|
|
9340 |
codeforces#P1918D Blocking Elements
|
1 / 1 |
10 |
|
|
9305 |
codeforces#P1919C Grouping Increases
|
2 / 2 |
4 |
|
|
9303 |
codeforces#P1919E Counting Prefixes
|
1 / 7 |
10 |
|
|
9317 |
codeforces#P1920E Counting Binary Strings
|
1 / 1 |
7 |
|
|
9308 |
codeforces#P1921G Mischievous Shooter
|
0 / 0 |
(无) |
|
|
9325 |
codeforces#P1922C Closest Cities
|
1 / 1 |
10 |
|
|
9323 |
codeforces#P1922E Increasing Subsequences
|
0 / 0 |
(无) |
|
|
9322 |
codeforces#P1922F Replace on Segment
|
1 / 1 |
10 |
|
|
9398 |
codeforces#P1923B Monsters Attack!
|
0 / 0 |
(无) |
|
|
9395 |
codeforces#P1923E Count Paths
|
0 / 0 |
(无) |
