|
|
10153 |
P1884C
Medium Design
|
0 / 0 |
(None) |
|
|
10152 |
P1884D
Counting Rhyme
|
0 / 0 |
(None) |
|
|
10072 |
P1886E
I Wanna be the Team Leader
|
0 / 0 |
(None) |
|
|
10143 |
P1889C1
Doremy's Drying Plan (Easy Version)
|
0 / 0 |
(None) |
|
|
10142 |
P1889C2
Doremy's Drying Plan (Hard Version)
|
0 / 0 |
(None) |
|
|
10139 |
P1889F
Doremy's Average Tree
|
0 / 0 |
(None) |
|
|
10180 |
P1893E
Cacti Symphony
|
0 / 0 |
10 |
|
|
10175 |
P1895C
Torn Lucky Ticket
|
0 / 0 |
4 |
|
|
10173 |
P1895E
Infinite Card Game
|
0 / 0 |
8 |
|
|
10172 |
P1895F
Fancy Arrays
|
0 / 0 |
10 |
|
|
10171 |
P1895G
Two Characters, Two Colors
|
0 / 0 |
10 |
|
|
10211 |
P1896H1
Cyclic Hamming (Easy Version)
|
0 / 0 |
10 |
|
|
10210 |
P1896H2
Cyclic Hamming (Hard Version)
|
0 / 0 |
10 |
|
|
10201 |
P1899C
Yarik and Array
|
0 / 0 |
3 |
|
|
10195 |
P1900B
Laura and Operations
|
0 / 0 |
3 |
|
|
10194 |
P1900C
Anji's Binary Tree
|
0 / 0 |
4 |
|
|
10193 |
P1900D
Small GCD
|
0 / 0 |
7 |
|
|
10192 |
P1900E
Transitive Graph
|
0 / 0 |
7 |
|
|
10187 |
P1901D
Yet Another Monster Fight
|
0 / 0 |
5 |
|
|
10186 |
P1901E
Compressed Tree
|
0 / 0 |
8 |
|
|
10311 |
P1909F1
Small Permutation Problem (Easy Version)
|
0 / 0 |
8 |
|
|
10310 |
P1909F2
Small Permutation Problem (Hard Version)
|
0 / 0 |
9 |
|
|
10307 |
P1909I
Short Permutation Problem
|
0 / 0 |
10 |
|
|
10302 |
P1910E
Maximum Sum Subarrays
|
0 / 0 |
7 |
|
|
10298 |
P1910I
Inverse Problem
|
0 / 0 |
10 |
|
|
10241 |
P1912K
Kim's Quest
|
0 / 0 |
6 |
|
|
10236 |
P1913D
Array Collapse
|
0 / 0 |
7 |
|
|
10230 |
P1914D
Three Activities
|
0 / 0 |
4 |
|
|
10227 |
P1914F
Programming Competition
|
0 / 0 |
6 |
|
|
10226 |
P1914G1
Light Bulbs (Easy Version)
|
0 / 0 |
7 |
|
|
10225 |
P1914G2
Light Bulbs (Hard Version)
|
0 / 0 |
8 |
|
|
10280 |
P1916G
Optimizations From Chelsu
|
0 / 0 |
10 |
|
|
10279 |
P1916H1
Matrix Rank (Easy Version)
|
0 / 0 |
10 |
|
|
10278 |
P1916H2
Matrix Rank (Hard Version)
|
0 / 0 |
10 |
|
|
10223 |
P1917B
Erase First or Second Letter
|
0 / 0 |
3 |
|
|
10219 |
P1917F
Construct Tree
|
0 / 0 |
9 |
|
|
10344 |
P1918D
Blocking Elements
|
0 / 0 |
6 |
|
|
10275 |
P1919C
Grouping Increases
|
0 / 0 |
4 |
|
|
10273 |
P1919E
Counting Prefixes
|
0 / 0 |
10 |
|
|
10271 |
P1919F2
Wine Factory (Hard Version)
|
0 / 0 |
10 |
|
|
10264 |
P1920E
Counting Binary Strings
|
0 / 0 |
7 |
|
|
10256 |
P1921F
Sum of Progression
|
0 / 0 |
6 |
|
|
10255 |
P1921G
Mischievous Shooter
|
0 / 0 |
8 |
|
|
10249 |
P1922F
Replace on Segment
|
0 / 1 |
9 |
|
|
10340 |
P1924A
Did We Get Everything Covered?
|
0 / 0 |
5 |
|
|
10337 |
P1924D
Balanced Subsequences
|
0 / 0 |
10 |
|
|
10335 |
P1924F
Anti-Proxy Attendance
|
0 / 0 |
10 |
|
|
10332 |
P1925D
Good Trip
|
0 / 0 |
6 |
|
|
10328 |
P1927D
Find the Different Ones!
|
0 / 0 |
(None) |
|
|
10325 |
P1927G
Paint Charges
|
0 / 0 |
(None) |
|
|
10320 |
P1928E
Modular Sequence
|
0 / 0 |
(None) |
|
|
10436 |
P1929D
Sasha and a Walk in the City
|
0 / 0 |
6 |
|
|
10435 |
P1929E
Sasha and the Happy Tree Cutting
|
0 / 0 |
8 |
|
|
10430 |
P1930D1
Sum over all Substrings (Easy Version)
|
0 / 0 |
6 |
|
|
10429 |
P1930D2
Sum over all Substrings (Hard Version)
|
0 / 0 |
7 |
|
|
10428 |
P1930E
2..3...4...
|
0 / 0 |
9 |
|
|
10426 |
P1930G
Prefix Max Set Counting
|
0 / 0 |
10 |
|
|
10416 |
P1932A
Thorns and Coins
|
0 / 0 |
3 |
|
|
10411 |
P1932F
Feed Cats
|
0 / 0 |
6 |
|
|
10404 |
P1933F
Turtle Mission: Robot and the Earthquake
|
0 / 0 |
7 |
|
|
10401 |
P1934B
Yet Another Coin Problem
|
0 / 0 |
4 |
|
|
10394 |
P1935C
Messenger in MAC
|
0 / 0 |
6 |
|
|
10383 |
P1937B
Binary Path
|
0 / 0 |
4 |
|
|
10360 |
P1941B
Rudolf and 121
|
0 / 0 |
3 |
|
|
10359 |
P1941C
Rudolf and the Ugly String
|
0 / 0 |
3 |
|
|
10358 |
P1941D
Rudolf and the Ball Game
|
0 / 0 |
4 |
|
|
10357 |
P1941E
Rudolf and k Bridges
|
0 / 0 |
5 |
|
|
10526 |
P1942D
Learning to Paint
|
0 / 0 |
(None) |
|
|
10523 |
P1942G
Bessie and Cards
|
0 / 0 |
(None) |
|
|
10522 |
P1942H
Farmer John's Favorite Intern
|
0 / 0 |
(None) |
|
|
10471 |
P1943D1
Counting Is Fun (Easy Version)
|
0 / 0 |
9 |
|
|
10470 |
P1943D2
Counting Is Fun (Hard Version)
|
0 / 0 |
10 |
|
|
10467 |
P1943F
Minimum Hamming Distance
|
0 / 0 |
10 |
|
|
10461 |
P1945D
Seraphim the Owl
|
0 / 0 |
4 |
|
|
10455 |
P1946B
Maximum Sum
|
0 / 0 |
3 |
|
|
10454 |
P1946C
Tree Cutting
|
0 / 0 |
5 |
|
|
10452 |
P1946E
Girl Permutation
|
0 / 0 |
8 |
|
|
10451 |
P1946F
Nobody is needed
|
0 / 0 |
9 |
|
|
10353 |
P1948B
Array Fix
|
0 / 0 |
(None) |
|
|
10352 |
P1948C
Arrow Path
|
0 / 0 |
(None) |
|
|
10351 |
P1948D
Tandem Repeats?
|
1 / 3 |
10 |
|
|
10450 |
P1949A
Grove
|
0 / 0 |
(None) |
|
|
10518 |
P1950D
Product of Binary Decimals
|
0 / 0 |
(None) |
|
|
10515 |
P1950G
Shuffling Songs
|
0 / 0 |
(None) |
|
|
10507 |
P1951H
Thanos Snap
|
0 / 0 |
(None) |
|
|
10492 |
P1954D
Colored Balls
|
0 / 0 |
(None) |
|
|
10490 |
P1954F
Unique Strings
|
0 / 0 |
(None) |
|
|
10484 |
P1955F
Unfair Game
|
0 / 0 |
(None) |
|
|
10483 |
P1955G
GCD on a grid
|
0 / 0 |
(None) |
|
|
10482 |
P1955H
The Most Reckless Defense
|
0 / 0 |
(None) |
|
|
10478 |
P1956D
Nene and the Mex Operator
|
0 / 0 |
(None) |
|
|
10619 |
P1967C
Fenwick Tree
|
0 / 0 |
8 |
|
|
10617 |
P1967E1
Again Counting Arrays (Easy Version)
|
0 / 0 |
10 |
|
|
10616 |
P1967E2
Again Counting Arrays (Hard Version)
|
0 / 0 |
10 |
|
|
10608 |
P1968G1
Division + LCP (easy version)
|
0 / 0 |
6 |
|
|
10607 |
P1968G2
Division + LCP (hard version)
|
0 / 0 |
8 |
|
|
10604 |
P1969C
Minimizing the Sum
|
0 / 0 |
5 |
|
|
10602 |
P1969E
Unique Array
|
0 / 0 |
9 |
|
|
10601 |
P1969F
Card Pairing
|
0 / 0 |
10 |
|
|
10593 |
P1970C2
Game on Tree (Medium)
|
0 / 0 |
5 |
