|
|
9065 |
P1893E
Cacti Symphony
|
0 / 0 |
10 |
|
|
8971 |
P1895C
Torn Lucky Ticket
|
0 / 0 |
(无) |
|
|
8968 |
P1895F
Fancy Arrays
|
0 / 0 |
(无) |
|
|
8967 |
P1895G
Two Characters, Two Colors
|
0 / 0 |
(无) |
|
|
9055 |
P1896H1
Cyclic Hamming (Easy Version)
|
0 / 0 |
10 |
|
|
9054 |
P1896H2
Cyclic Hamming (Hard Version)
|
0 / 0 |
10 |
|
|
9045 |
P1899C
Yarik and Array
|
0 / 0 |
3 |
|
|
9039 |
P1900B
Laura and Operations
|
0 / 0 |
3 |
|
|
9038 |
P1900C
Anji's Binary Tree
|
0 / 0 |
4 |
|
|
9037 |
P1900D
Small GCD
|
0 / 0 |
7 |
|
|
9036 |
P1900E
Transitive Graph
|
0 / 0 |
7 |
|
|
9031 |
P1901D
Yet Another Monster Fight
|
0 / 0 |
5 |
|
|
9030 |
P1901E
Compressed Tree
|
0 / 0 |
8 |
|
|
9025 |
P1902D
Robot Queries
|
0 / 0 |
6 |
|
|
9018 |
P1903D2
Maximum And Queries (hard version)
|
0 / 0 |
9 |
|
|
9014 |
P1904B
Collecting Game
|
0 / 0 |
(无) |
|
|
9124 |
P1905E
One-X
|
0 / 0 |
9 |
|
|
9004 |
P1906E
Merge Not Sort
|
0 / 0 |
6 |
|
|
9001 |
P1906H
Twin Friends
|
0 / 0 |
8 |
|
|
8999 |
P1906J
Count BFS Graph
|
0 / 0 |
7 |
|
|
9117 |
P1909F1
Small Permutation Problem (Easy Version)
|
0 / 0 |
8 |
|
|
9116 |
P1909F2
Small Permutation Problem (Hard Version)
|
0 / 0 |
9 |
|
|
9113 |
P1909I
Short Permutation Problem
|
0 / 0 |
10 |
|
|
9108 |
P1910E
Maximum Sum Subarrays
|
0 / 0 |
7 |
|
|
9104 |
P1910I
Inverse Problem
|
0 / 0 |
10 |
|
|
9092 |
P1912K
Kim's Quest
|
0 / 0 |
6 |
|
|
9087 |
P1913D
Array Collapse
|
0 / 0 |
7 |
|
|
9081 |
P1914D
Three Activities
|
0 / 0 |
4 |
|
|
9078 |
P1914F
Programming Competition
|
0 / 0 |
6 |
|
|
9077 |
P1914G1
Light Bulbs (Easy Version)
|
0 / 0 |
7 |
|
|
9076 |
P1914G2
Light Bulbs (Hard Version)
|
0 / 0 |
8 |
|
|
9140 |
P1916G
Optimizations From Chelsu
|
0 / 0 |
10 |
|
|
9139 |
P1916H1
Matrix Rank (Easy Version)
|
0 / 0 |
10 |
|
|
9138 |
P1916H2
Matrix Rank (Hard Version)
|
0 / 0 |
10 |
|
|
9074 |
P1917B
Erase First or Second Letter
|
0 / 0 |
3 |
|
|
9070 |
P1917F
Construct Tree
|
0 / 0 |
9 |
|
|
9187 |
P1918C
XOR-distance
|
0 / 0 |
(无) |
|
|
9186 |
P1918D
Blocking Elements
|
0 / 0 |
(无) |
|
|
9135 |
P1919C
Grouping Increases
|
0 / 0 |
4 |
|
|
9134 |
P1919D
01 Tree
|
0 / 0 |
7 |
|
|
9133 |
P1919E
Counting Prefixes
|
0 / 0 |
10 |
|
|
9131 |
P1919F2
Wine Factory (Hard Version)
|
0 / 0 |
10 |
|
|
9169 |
P1920E
Counting Binary Strings
|
0 / 0 |
7 |
|
|
9161 |
P1921F
Sum of Progression
|
0 / 0 |
6 |
|
|
9160 |
P1921G
Mischievous Shooter
|
0 / 0 |
8 |
|
|
9154 |
P1922F
Replace on Segment
|
0 / 0 |
9 |
|
|
9182 |
P1924A
Did We Get Everything Covered?
|
0 / 0 |
(无) |
|
|
9179 |
P1924D
Balanced Subsequences
|
0 / 0 |
(无) |
|
|
9177 |
P1924F
Anti-Proxy Attendance
|
0 / 0 |
(无) |
|
|
9285 |
P1926C
Vlad and a Sum of Sum of Digits
|
0 / 0 |
(无) |
|
|
9283 |
P1926E
Vlad and an Odd Ordering
|
0 / 0 |
(无) |
|
|
9282 |
P1926F
Vlad and Avoiding X
|
0 / 0 |
(无) |
|
|
9281 |
P1926G
Vlad and Trouble at MIT
|
0 / 0 |
(无) |
|
|
9212 |
P1927D
Find the Different Ones!
|
0 / 0 |
4 |
|
|
9209 |
P1927G
Paint Charges
|
0 / 0 |
8 |
|
|
9204 |
P1928E
Modular Sequence
|
0 / 0 |
8 |
|
|
9199 |
P1929D
Sasha and a Walk in the City
|
0 / 0 |
6 |
|
|
9198 |
P1929E
Sasha and the Happy Tree Cutting
|
0 / 0 |
8 |
|
|
9277 |
P1930D1
Sum over all Substrings (Easy Version)
|
0 / 0 |
(无) |
|
|
9276 |
P1930D2
Sum over all Substrings (Hard Version)
|
0 / 0 |
(无) |
|
|
9275 |
P1930E
2..3...4...
|
0 / 0 |
(无) |
|
|
9273 |
P1930G
Prefix Max Set Counting
|
0 / 0 |
(无) |
|
|
9270 |
P1932A
Thorns and Coins
|
0 / 0 |
(无) |
|
|
9265 |
P1932F
Feed Cats
|
0 / 0 |
(无) |
|
|
9258 |
P1933F
Turtle Mission: Robot and the Earthquake
|
0 / 0 |
(无) |
|
|
9255 |
P1934B
Yet Another Coin Problem
|
0 / 0 |
(无) |
|
|
9248 |
P1935C
Messenger in MAC
|
0 / 0 |
(无) |
|
|
9237 |
P1937B
Binary Path
|
0 / 0 |
(无) |
|
|
9310 |
P1941B
Rudolf and 121
|
0 / 0 |
3 |
|
|
9309 |
P1941C
Rudolf and the Ugly String
|
0 / 0 |
3 |
|
|
9308 |
P1941D
Rudolf and the Ball Game
|
0 / 0 |
4 |
|
|
9307 |
P1941E
Rudolf and k Bridges
|
0 / 0 |
5 |
|
|
9388 |
P1942D
Learning to Paint
|
0 / 0 |
7 |
|
|
9385 |
P1942G
Bessie and Cards
|
0 / 0 |
10 |
|
|
9384 |
P1942H
Farmer John's Favorite Intern
|
0 / 0 |
10 |
|
|
9301 |
P1943D1
Counting Is Fun (Easy Version)
|
0 / 0 |
(无) |
|
|
9300 |
P1943D2
Counting Is Fun (Hard Version)
|
0 / 0 |
(无) |
|
|
9297 |
P1943F
Minimum Hamming Distance
|
0 / 0 |
(无) |
|
|
9322 |
P1945D
Seraphim the Owl
|
0 / 0 |
(无) |
|
|
9315 |
P1946C
Tree Cutting
|
0 / 0 |
(无) |
|
|
9313 |
P1946E
Girl Permutation
|
0 / 0 |
(无) |
|
|
9312 |
P1946F
Nobody is needed
|
0 / 0 |
(无) |
|
|
9293 |
P1948B
Array Fix
|
0 / 0 |
(无) |
|
|
9292 |
P1948C
Arrow Path
|
0 / 0 |
(无) |
|
|
9291 |
P1948D
Tandem Repeats?
|
0 / 0 |
(无) |
|
|
9383 |
P1949A
Grove
|
0 / 0 |
(无) |
|
|
9381 |
P1949C
Annual Ants' Gathering
|
0 / 0 |
(无) |
|
|
9369 |
P1950D
Product of Binary Decimals
|
0 / 0 |
3 |
|
|
9366 |
P1950G
Shuffling Songs
|
0 / 0 |
6 |
|
|
9358 |
P1951H
Thanos Snap
|
0 / 0 |
10 |
|
|
9343 |
P1954D
Colored Balls
|
0 / 0 |
6 |
|
|
9341 |
P1954F
Unique Strings
|
0 / 0 |
10 |
|
|
9335 |
P1955F
Unfair Game
|
0 / 0 |
6 |
|
|
9334 |
P1955G
GCD on a grid
|
0 / 0 |
6 |
|
|
9333 |
P1955H
The Most Reckless Defense
|
0 / 0 |
8 |
|
|
9329 |
P1956D
Nene and the Mex Operator
|
0 / 0 |
7 |
|
|
9397 |
P1957C
How Does the Rook Move?
|
0 / 0 |
(无) |
|
|
9396 |
P1957D
A BIT of an Inequality
|
0 / 0 |
(无) |
|
|
9395 |
P1957E
Carousel of Combinations
|
0 / 0 |
(无) |
|
|
9470 |
P1958A
1-3-5
|
0 / 0 |
3 |
