|
|
804 |
P1663B
Mike's Sequence
|
0 / 0 |
(无) |
|
|
793 |
P1665E
MinimizOR
|
0 / 0 |
9 |
|
|
754 |
P1671E
Preorder
|
0 / 0 |
7 |
|
|
737 |
P1673F
Anti-Theft Road Planning
|
0 / 0 |
9 |
|
|
714 |
P1676H2
Maximum Crossings (Hard Version)
|
0 / 0 |
5 |
|
|
693 |
P1680F
Lenient Vertex Cover
|
0 / 0 |
10 |
|
|
687 |
P1681F
Unique Occurrences
|
0 / 0 |
8 |
|
|
673 |
P1684H
Hard Cut
|
0 / 0 |
10 |
|
|
640 |
P1691D
Max GEQ Sum
|
0 / 0 |
6 |
|
|
626 |
P1693D
Decinc Dividing
|
0 / 0 |
10 |
|
|
612 |
P1696D
Permutation Graph
|
0 / 0 |
6 |
|
|
542 |
P1706E
Qpwoeirut and Vertices
|
0 / 0 |
8 |
|
|
496 |
P1715E
Long Way Home
|
0 / 0 |
9 |
|
|
490 |
P1716E
Swap and Maximum Block
|
0 / 0 |
9 |
|
|
463 |
P1721D
Maximum AND
|
0 / 0 |
6 |
|
|
414 |
P1730E
Maximums and Minimums
|
0 / 0 |
10 |
|
|
388 |
P1734F
Zeros and Ones
|
0 / 0 |
9 |
|
|
346 |
P1740I
Arranging Crystal Balls
|
0 / 0 |
10 |
|
|
342 |
P1741D
Masha and a Beautiful Tree
|
0 / 0 |
4 |
|
|
300 |
P1748E
Yet Another Array Counting Problem
|
0 / 0 |
8 |
|
|
288 |
P1750E
Bracket Cost
|
0 / 0 |
9 |
|
|
206 |
P1766E
Decomposition
|
0 / 0 |
8 |
|
|
186 |
P1770G
Koxia and Bracket
|
0 / 0 |
10 |
|
|
177 |
P1773B
BinCoin
|
0 / 0 |
8 |
|
|
131 |
P1777F
Comfortably Numb
|
0 / 0 |
9 |
|
|
95 |
P1783G
Weighed Tree Radius
|
0 / 0 |
10 |
|
|
77 |
P1787I
Treasure Hunt
|
0 / 0 |
10 |
|
|
59 |
P1790F
Timofey and Black-White Tree
|
0 / 0 |
7 |
|
|
43 |
P1792F2
Graph Coloring (hard version)
|
0 / 0 |
10 |
|
|
37 |
P1793F
Rebrending
|
0 / 0 |
10 |
|
|
33 |
P1794D
Counting Factorizations
|
0 / 0 |
(无) |
|
|
21 |
P1796D
Maximum Subarray
|
0 / 0 |
7 |
|
|
3776 |
P1801E
Gasoline prices
|
0 / 0 |
(无) |
|
|
3766 |
P1804F
Approximate Diameter
|
0 / 0 |
(无) |
|
|
7787 |
P1808E1
Minibuses on Venus (easy version)
|
0 / 0 |
8 |
|
|
7786 |
P1808E2
Minibuses on Venus (medium version)
|
0 / 0 |
9 |
|
|
8544 |
P1814F
Communication Towers
|
0 / 0 |
10 |
|
|
8589 |
P1817E
Half-sum
|
0 / 0 |
10 |
|
|
8705 |
P1842I
Tenzing and Necklace
|
0 / 0 |
10 |
|
|
8728 |
P1848F
Vika and Wiki
|
0 / 0 |
(无) |
|
|
8770 |
P1849E
Max to the Right of Min
|
0 / 0 |
(无) |
|
|
8769 |
P1849F
XOR Partition
|
0 / 0 |
(无) |
|
|
8786 |
P1856D
More Wrong
|
0 / 0 |
(无) |
|
|
8808 |
P1857G
Counting Graphs
|
0 / 0 |
7 |
|
|
8796 |
P1859F
Teleportation in Byteland
|
0 / 0 |
10 |
|
|
8963 |
P1874D
Jellyfish and Miku
|
0 / 0 |
(无) |
|
|
8937 |
P1879D
Sum of XOR Functions
|
0 / 0 |
5 |
|
|
8900 |
P1887D
Split
|
0 / 0 |
(无) |
|
|
9059 |
P1896D
Ones and Twos
|
0 / 0 |
5 |
|
|
9055 |
P1896H1
Cyclic Hamming (Easy Version)
|
0 / 0 |
10 |
|
|
9048 |
P1898F
Vova Escapes the Matrix
|
0 / 0 |
10 |
|
|
9023 |
P1902F
Trees and XOR Queries Again
|
0 / 0 |
9 |
|
|
9018 |
P1903D2
Maximum And Queries (hard version)
|
0 / 0 |
9 |
|
|
9123 |
P1905F
Field Should Not Be Empty
|
0 / 0 |
10 |
|
|
8998 |
P1906K
Deck-Building Game
|
0 / 0 |
9 |
|
|
9101 |
P1912B
Blueprint for Seating
|
0 / 0 |
7 |
|
|
9087 |
P1913D
Array Collapse
|
0 / 0 |
7 |
|
|
9148 |
P1915F
Greetings
|
0 / 0 |
5 |
|
|
9140 |
P1916G
Optimizations From Chelsu
|
0 / 0 |
10 |
|
|
9072 |
P1917D
Yet Another Inversions Problem
|
0 / 0 |
8 |
|
|
9185 |
P1918E
ace5 and Task Order
|
0 / 0 |
(无) |
|
|
9134 |
P1919D
01 Tree
|
0 / 0 |
7 |
|
|
9130 |
P1919G
Tree LGM
|
0 / 0 |
10 |
|
|
9160 |
P1921G
Mischievous Shooter
|
0 / 0 |
8 |
|
|
9276 |
P1930D2
Sum over all Substrings (Hard Version)
|
0 / 0 |
(无) |
|
|
9240 |
P1936E
Yet Yet Another Permutation Problem
|
0 / 0 |
(无) |
|
|
9361 |
P1951E
No Palindromes
|
0 / 0 |
7 |
|
|
9329 |
P1956D
Nene and the Mex Operator
|
0 / 0 |
7 |
|
|
9394 |
P1957F1
Frequency Mismatch (Easy Version)
|
0 / 0 |
(无) |
|
|
9432 |
P1969E
Unique Array
|
0 / 0 |
9 |
|
|
9485 |
P1975F
Set
|
0 / 0 |
(无) |
|
|
9573 |
P1982E
Number of k-good subarrays
|
0 / 0 |
8 |
|
|
9555 |
P1987G2
Spinning Round (Hard Version)
|
0 / 0 |
10 |
|
|
9631 |
P1988E
Range Minimum Sum
|
0 / 0 |
8 |
|
|
9548 |
P1989F
Simultaneous Coloring
|
0 / 0 |
10 |
|
|
9624 |
P1990E2
Catch the Mole(Hard Version)
|
0 / 0 |
10 |
|
|
9623 |
P1990F
Polygonal Segments
|
0 / 0 |
10 |
|
|
9580 |
P1997E
Level Up
|
3 / 13 |
9 |
