|
8109 |
P1872E
Data Structures Fan
|
0 / 0 |
5 |
|
8097 |
P1874B
Jellyfish and Math
|
0 / 0 |
(无) |
|
8096 |
P1874C
Jellyfish and EVA
|
0 / 0 |
(无) |
|
8095 |
P1874D
Jellyfish and Miku
|
0 / 0 |
(无) |
|
8094 |
P1874E
Jellyfish and Hack
|
0 / 0 |
(无) |
|
8093 |
P1874F
Jellyfish and OEIS
|
0 / 0 |
(无) |
|
8092 |
P1874G
Jellyfish and Inscryption
|
0 / 0 |
(无) |
|
8089 |
P1875D
Jellyfish and Mex
|
0 / 0 |
(无) |
|
8079 |
P1879C
Make it Alternating
|
0 / 0 |
4 |
|
8078 |
P1879D
Sum of XOR Functions
|
0 / 0 |
5 |
|
8072 |
P1882D
Tree XOR
|
0 / 0 |
(无) |
|
8269 |
P1905E
One-X
|
0 / 0 |
9 |
|
8263 |
P1906E
Merge Not Sort
|
0 / 0 |
6 |
|
8260 |
P1906H
Twin Friends
|
0 / 0 |
8 |
|
8258 |
P1906J
Count BFS Graph
|
0 / 0 |
7 |
|
8242 |
P1909F1
Small Permutation Problem (Easy Version)
|
0 / 0 |
8 |
|
8241 |
P1909F2
Small Permutation Problem (Hard Version)
|
0 / 0 |
9 |
|
8238 |
P1909I
Short Permutation Problem
|
0 / 0 |
10 |
|
8233 |
P1910E
Maximum Sum Subarrays
|
0 / 0 |
7 |
|
8229 |
P1910I
Inverse Problem
|
0 / 0 |
10 |
|
8217 |
P1912K
Kim's Quest
|
0 / 0 |
6 |
|
8212 |
P1913D
Array Collapse
|
0 / 0 |
7 |
|
8206 |
P1914D
Three Activities
|
0 / 0 |
4 |
|
8203 |
P1914F
Programming Competition
|
0 / 0 |
6 |
|
8202 |
P1914G1
Light Bulbs (Easy Version)
|
0 / 0 |
7 |
|
8201 |
P1914G2
Light Bulbs (Hard Version)
|
0 / 0 |
8 |
|
8187 |
P1916G
Optimizations From Chelsu
|
0 / 0 |
10 |
|
8186 |
P1916H1
Matrix Rank (Easy Version)
|
0 / 0 |
10 |
|
8185 |
P1916H2
Matrix Rank (Hard Version)
|
0 / 0 |
10 |
|
8183 |
P1917B
Erase First or Second Letter
|
0 / 0 |
3 |
|
8181 |
P1917D
Yet Another Inversions Problem
|
0 / 0 |
8 |
|
8179 |
P1917F
Construct Tree
|
0 / 0 |
9 |
|
8302 |
P1918D
Blocking Elements
|
0 / 0 |
6 |
|
8176 |
P1919C
Grouping Increases
|
0 / 0 |
4 |
|
8174 |
P1919E
Counting Prefixes
|
0 / 0 |
10 |
|
8172 |
P1919F2
Wine Factory (Hard Version)
|
0 / 0 |
10 |
|
8294 |
P1920E
Counting Binary Strings
|
0 / 0 |
7 |
|
8286 |
P1921F
Sum of Progression
|
0 / 0 |
6 |
|
8285 |
P1921G
Mischievous Shooter
|
0 / 0 |
8 |
|
8279 |
P1922F
Replace on Segment
|
0 / 0 |
9 |
|
8357 |
P1923E
Count Paths
|
0 / 0 |
(无) |
|
8278 |
P1924A
Did We Get Everything Covered?
|
0 / 0 |
(无) |
|
8275 |
P1924D
Balanced Subsequences
|
0 / 0 |
(无) |
|
8270 |
P1925D
Good Trip
|
0 / 0 |
(无) |
|
8353 |
P1926C
Vlad and a Sum of Sum of Digits
|
0 / 0 |
(无) |
|
8351 |
P1926E
Vlad and an Odd Ordering
|
0 / 0 |
(无) |
|
8350 |
P1926F
Vlad and Avoiding X
|
0 / 0 |
(无) |
|
8349 |
P1926G
Vlad and Trouble at MIT
|
0 / 2 |
10 |
|
8345 |
P1927D
Find the Different Ones!
|
0 / 0 |
4 |
|
8342 |
P1927G
Paint Charges
|
0 / 0 |
8 |