|
|
20 |
P1955C
Inhabitant of the Deep Sea
|
0 / 0 |
4 |
|
|
18 |
P1955E
Long Inversions
|
0 / 0 |
5 |
|
|
16 |
P1955G
GCD on a grid
|
0 / 0 |
6 |
|
|
11 |
P1956D
Nene and the Mex Operator
|
0 / 0 |
7 |
|
|
10 |
P1956E1
Nene vs
|
0 / 0 |
9 |
|
|
9 |
P1956E2
Nene vs
|
0 / 0 |
10 |
|
|
6 |
P1957B
A BIT of a Construction
|
0 / 0 |
(无) |
|
|
9518 |
P1971B
Different String
|
0 / 0 |
3 |
|
|
9517 |
P1971C
Clock and Strings
|
0 / 0 |
3 |
|
|
9516 |
P1971D
Binary Cut
|
0 / 0 |
3 |
|
|
9514 |
P1971F
Circle Perimeter
|
0 / 0 |
5 |
|
|
9509 |
P1973A
Chess For Three
|
0 / 0 |
3 |
|
|
9507 |
P1973C
Cat, Fox and Double Maximum
|
0 / 0 |
5 |
|
|
9504 |
P1973F
Maximum GCD Sum Queries
|
0 / 0 |
10 |
|
|
9502 |
P1974B
Symmetric Encoding
|
0 / 0 |
3 |
|
|
9500 |
P1974D
Ingenuity-2
|
0 / 0 |
4 |
|
|
9498 |
P1974F
Cutting Game
|
0 / 0 |
6 |
|
|
9496 |
P1975A
Bazoka and Mocha's Array
|
0 / 0 |
3 |
|
|
9492 |
P1975E
Chain Queries
|
0 / 0 |
7 |
|
|
9487 |
P1976A
Verify Password
|
0 / 0 |
3 |
|
|
9486 |
P1976B
Increase/Decrease/Copy
|
0 / 0 |
3 |
|
|
9485 |
P1976C
Job Interview
|
0 / 0 |
5 |
|
|
9484 |
P1976D
Invertible Bracket Sequences
|
0 / 0 |
7 |
|
|
9474 |
P1978C
Manhattan Permutations
|
0 / 0 |
4 |
|
|
9473 |
P1978D
Elections
|
0 / 0 |
5 |
|
|
9472 |
P1978E
Computing Machine
|
0 / 0 |
7 |
|
|
9470 |
P1979A
Guess the Maximum
|
0 / 0 |
3 |
|
|
9466 |
P1979E
Manhattan Triangle
|
0 / 0 |
9 |
|
|
9461 |
P1980D
GCD-sequence
|
0 / 0 |
4 |
|
|
9460 |
P1980E
Permutation of Rows and Columns
|
0 / 0 |
5 |
|
|
9454 |
P1981C
Turtle and an Incomplete Sequence
|
0 / 0 |
6 |
|
|
9450 |
P1982A
Soccer
|
0 / 0 |
(无) |
|
|
9449 |
P1982B
Collatz Conjecture
|
0 / 0 |
(无) |
|
|
9447 |
P1982D
Beauty of the mountains
|
0 / 0 |
(无) |
|
|
9443 |
P1984B
Large Addition
|
0 / 0 |
3 |
|
|
9440 |
P1984D
"a" String Problem
|
0 / 0 |
7 |
|
|
9437 |
P1984G
Magic Trick II
|
0 / 0 |
10 |
|
|
9435 |
P1985A
Creating Words
|
0 / 0 |
3 |
|
|
9432 |
P1985D
Manhattan Circle
|
0 / 0 |
3 |
|
|
9428 |
P1985H1
Maximize the Largest Component (Easy Version)
|
0 / 0 |
5 |
|
|
9427 |
P1985H2
Maximize the Largest Component (Hard Version)
|
0 / 0 |
8 |
|
|
9423 |
P1986D
Mathematical Problem
|
0 / 0 |
(无) |