|
|
8337 |
P1928E
Modular Sequence
|
0 / 0 |
8 |
|
|
8332 |
P1929D
Sasha and a Walk in the City
|
0 / 0 |
6 |
|
|
8331 |
P1929E
Sasha and the Happy Tree Cutting
|
0 / 0 |
8 |
|
|
8326 |
P1930D1
Sum over all Substrings (Easy Version)
|
0 / 0 |
(无) |
|
|
8325 |
P1930D2
Sum over all Substrings (Hard Version)
|
0 / 0 |
(无) |
|
|
8324 |
P1930E
2..3...4...
|
0 / 0 |
(无) |
|
|
8322 |
P1930G
Prefix Max Set Counting
|
0 / 0 |
(无) |
|
|
8312 |
P1932A
Thorns and Coins
|
0 / 0 |
(无) |
|
|
8307 |
P1932F
Feed Cats
|
0 / 0 |
(无) |
|
|
8390 |
P1933F
Turtle Mission: Robot and the Earthquake
|
0 / 0 |
(无) |
|
|
8387 |
P1934B
Yet Another Coin Problem
|
0 / 0 |
(无) |
|
|
8399 |
P1935C
Messenger in MAC
|
0 / 0 |
(无) |
|
|
8375 |
P1937B
Binary Path
|
0 / 0 |
(无) |
|
|
8438 |
P1941B
Rudolf and 121
|
0 / 0 |
3 |
|
|
8437 |
P1941C
Rudolf and the Ugly String
|
0 / 0 |
3 |
|
|
8436 |
P1941D
Rudolf and the Ball Game
|
0 / 0 |
4 |
|
|
8435 |
P1941E
Rudolf and k Bridges
|
0 / 0 |
5 |
|
|
8470 |
P1942D
Learning to Paint
|
0 / 0 |
(无) |
|
|
8466 |
P1942H
Farmer John's Favorite Intern
|
0 / 0 |
(无) |
|
|
8429 |
P1943D1
Counting Is Fun (Easy Version)
|
0 / 0 |
9 |
|
|
8428 |
P1943D2
Counting Is Fun (Hard Version)
|
0 / 0 |
10 |
|
|
8425 |
P1943F
Minimum Hamming Distance
|
0 / 0 |
10 |
|
|
8419 |
P1945D
Seraphim the Owl
|
0 / 0 |
4 |
|
|
8413 |
P1946B
Maximum Sum
|
0 / 0 |
3 |
|
|
8412 |
P1946C
Tree Cutting
|
0 / 0 |
5 |
|
|
8410 |
P1946E
Girl Permutation
|
0 / 0 |
8 |
|
|
8409 |
P1946F
Nobody is needed
|
0 / 0 |
9 |
|
|
8407 |
P1948B
Array Fix
|
0 / 0 |
3 |
|
|
8406 |
P1948C
Arrow Path
|
0 / 0 |
4 |
|
|
8458 |
P1949A
Grove
|
0 / 0 |
(无) |
|
|
8462 |
P1950D
Product of Binary Decimals
|
0 / 0 |
(无) |
|
|
8459 |
P1950G
Shuffling Songs
|
0 / 0 |
(无) |
|
|
8507 |
P1951H
Thanos Snap
|
0 / 0 |
(无) |
|
|
8502 |
P1954D
Colored Balls
|
0 / 0 |
(无) |
|
|
8500 |
P1954F
Unique Strings
|
0 / 0 |
(无) |
|
|
8494 |
P1955F
Unfair Game
|
0 / 0 |
(无) |
|
|
8493 |
P1955G
GCD on a grid
|
0 / 0 |
(无) |
|
|
8492 |
P1955H
The Most Reckless Defense
|
0 / 0 |
(无) |
|
|
8488 |
P1956D
Nene and the Mex Operator
|
0 / 0 |
(无) |
|
|
8603 |
P1967C
Fenwick Tree
|
0 / 0 |
8 |
|
|
8601 |
P1967E1
Again Counting Arrays (Easy Version)
|
0 / 0 |
10 |
|
|
8600 |
P1967E2
Again Counting Arrays (Hard Version)
|
0 / 0 |
10 |
|
|
8592 |
P1968G1
Division + LCP (easy version)
|
0 / 0 |
6 |
|
|
8591 |
P1968G2
Division + LCP (hard version)
|
0 / 0 |
8 |
|
|
8588 |
P1969C
Minimizing the Sum
|
0 / 0 |
5 |
|
|
8586 |
P1969E
Unique Array
|
0 / 0 |
9 |
|
|
8585 |
P1969F
Card Pairing
|
0 / 0 |
10 |
|
|
8577 |
P1970C2
Game on Tree (Medium)
|
0 / 0 |
5 |
|
|
8576 |
P1970C3
Game on Tree (Hard)
|
0 / 0 |
6 |
|
|
8572 |
P1970E1
Trails (Easy)
|
0 / 0 |
6 |
