|
|
9440 |
P1941E Rudolf and k Bridges
|
0 / 0 |
5 |
|
|
9518 |
P1942D Learning to Paint
|
0 / 0 |
(无) |
|
|
9516 |
P1942F Farmer John's Favorite Function
|
0 / 0 |
(无) |
|
|
9514 |
P1942H Farmer John's Favorite Intern
|
0 / 0 |
(无) |
|
|
9470 |
P1943B Non-Palindromic Substring
|
0 / 0 |
(无) |
|
|
9474 |
P1945F Kirill and Mushrooms
|
0 / 0 |
(无) |
|
|
9473 |
P1945G Cook and Porridge
|
0 / 0 |
(无) |
|
|
9480 |
P1946F Nobody is needed
|
0 / 0 |
9 |
|
|
9530 |
P1951B Battle Cows
|
0 / 1 |
10 |
|
|
9526 |
P1951F Inversion Composition
|
0 / 0 |
(无) |
|
|
9608 |
P1954E Chain Reaction
|
0 / 0 |
8 |
|
|
9605 |
P1955B Progressive Square
|
0 / 0 |
3 |
|
|
9603 |
P1955D Inaccurate Subsequence Search
|
0 / 0 |
4 |
|
|
9598 |
P1956A Nene's Game
|
0 / 0 |
3 |
|
|
9592 |
P1956F Nene and the Passing Game
|
0 / 0 |
10 |
|
|
9586 |
P1957F1 Frequency Mismatch (Easy Version)
|
0 / 0 |
10 |
|
|
9585 |
P1957F2 Frequency Mismatch (Hard Version)
|
0 / 0 |
10 |
|
|
9579 |
P1965F Conference
|
0 / 0 |
10 |
|
|
9573 |
P1967C Fenwick Tree
|
0 / 0 |
(无) |
|
|
9569 |
P1967F Next and Prev
|
0 / 0 |
(无) |
|
|
9563 |
P1968F Equal XOR Segments
|
0 / 0 |
(无) |
|
|
9562 |
P1968G1 Division + LCP (easy version)
|
0 / 0 |
(无) |
|
|
9561 |
P1968G2 Division + LCP (hard version)
|
0 / 0 |
(无) |
|
|
9557 |
P1969D Shop Game
|
0 / 0 |
(无) |
|
|
9556 |
P1969E Unique Array
|
0 / 0 |
(无) |
|
|
9641 |
P1973B Cat, Fox and the Lonely Array
|
0 / 0 |
4 |
|
|
9634 |
P1974C Beautiful Triple Pairs
|
0 / 0 |
4 |
|
|
9631 |
P1974F Cutting Game
|
0 / 0 |
6 |
|
|
9630 |
P1974G Money Buys Less Happiness Now
|
0 / 1 |
7 |
|
|
9625 |
P1975E Chain Queries
|
0 / 0 |
(无) |
|
|
9660 |
P1976D Invertible Bracket Sequences
|
0 / 0 |
(无) |
|
|
9655 |
P1977C Nikita and LCM
|
0 / 0 |
(无) |
|
|
9705 |
P1978C Manhattan Permutations
|
0 / 0 |
(无) |
|
|
9704 |
P1978D Elections
|
0 / 0 |
(无) |
|
|
9703 |
P1978E Computing Machine
|
0 / 0 |
(无) |
|
|
9702 |
P1978F Large Graph
|
0 / 0 |
(无) |
|
|
9679 |
P1979E Manhattan Triangle
|
0 / 0 |
(无) |
|
|
9673 |
P1980E Permutation of Rows and Columns
|
0 / 0 |
(无) |
|
|
9672 |
P1980F1 Field Division (easy version)
|
0 / 0 |
(无) |
|
|
9670 |
P1980G Yasya and the Mysterious Tree
|
0 / 0 |
(无) |
|
|
9665 |
P1981E Turtle and Intersected Segments
|
1 / 1 |
10 |
|
|
9664 |
P1981F Turtle and Paths on a Tree
|
1 / 1 |
10 |
|
|
9719 |
P1982C Boring Day
|
0 / 0 |
(无) |
|
|
9718 |
P1982D Beauty of the mountains
|
0 / 0 |
(无) |
|
|
9716 |
P1982F Sorting Problem Again
|
0 / 0 |
(无) |
|
|
9741 |
P1983D Swap Dilemma
|
0 / 0 |
(无) |
|
|
9739 |
P1983F array-value
|
0 / 0 |
(无) |
|
|
9687 |
P1985F Final Boss
|
1 / 3 |
10 |
|
|
9685 |
P1985H1 Maximize the Largest Component (Easy Version)
|
0 / 0 |
(无) |
|
|
9684 |
P1985H2 Maximize the Largest Component (Hard Version)
|
0 / 0 |
(无) |
