|
|
23 |
P1954F
Unique Strings
|
0 / 0 |
10 |
|
|
17 |
P1955F
Unfair Game
|
0 / 0 |
6 |
|
|
16 |
P1955G
GCD on a grid
|
0 / 0 |
6 |
|
|
15 |
P1955H
The Most Reckless Defense
|
0 / 0 |
8 |
|
|
11 |
P1956D
Nene and the Mex Operator
|
0 / 0 |
7 |
|
|
5 |
P1957C
How Does the Rook Move?
|
0 / 0 |
(无) |
|
|
4 |
P1957D
A BIT of an Inequality
|
0 / 0 |
(无) |
|
|
3 |
P1957E
Carousel of Combinations
|
0 / 0 |
(无) |
|
|
9516 |
P1971D
Binary Cut
|
0 / 0 |
3 |
|
|
9509 |
P1973A
Chess For Three
|
0 / 0 |
3 |
|
|
9504 |
P1973F
Maximum GCD Sum Queries
|
0 / 0 |
10 |
|
|
9499 |
P1974E
Money Buys Happiness
|
0 / 0 |
6 |
|
|
9493 |
P1975D
Paint the Tree
|
0 / 0 |
5 |
|
|
9491 |
P1975F
Set
|
0 / 0 |
10 |
|
|
9488 |
P1975I
Mind Bloom
|
0 / 0 |
10 |
|
|
9485 |
P1976C
Job Interview
|
0 / 0 |
5 |
|
|
9482 |
P1976F
Remove Bridges
|
0 / 0 |
10 |
|
|
9479 |
P1977C
Nikita and LCM
|
0 / 0 |
6 |
|
|
9472 |
P1978E
Computing Machine
|
0 / 0 |
7 |
|
|
9467 |
P1979D
Fixing a Binary String
|
0 / 0 |
6 |
|
|
9451 |
P1981F
Turtle and Paths on a Tree
|
0 / 0 |
10 |
|
|
9448 |
P1982C
Boring Day
|
0 / 0 |
(无) |
|
|
9446 |
P1982E
Number of k-good subarrays
|
0 / 0 |
(无) |
|
|
9442 |
P1984C1
Magnitude (Easy Version)
|
0 / 0 |
4 |
|
|
9441 |
P1984C2
Magnitude (Hard Version)
|
0 / 0 |
5 |
|
|
9439 |
P1984E
Shuffle
|
0 / 0 |
9 |
|
|
9438 |
P1984F
Reconstruction
|
0 / 0 |
9 |
|
|
9436 |
P1984H
Tower Capturing
|
0 / 0 |
10 |
|
|
9427 |
P1985H2
Maximize the Largest Component (Hard Version)
|
0 / 0 |
8 |
|
|
9423 |
P1986D
Mathematical Problem
|
0 / 0 |
(无) |
