|
|
1005 |
P1663B
Mike's Sequence
|
0 / 0 |
(无) |
|
|
994 |
P1665E
MinimizOR
|
0 / 0 |
9 |
|
|
955 |
P1671E
Preorder
|
0 / 0 |
7 |
|
|
938 |
P1673F
Anti-Theft Road Planning
|
0 / 0 |
9 |
|
|
915 |
P1676H2
Maximum Crossings (Hard Version)
|
0 / 0 |
5 |
|
|
894 |
P1680F
Lenient Vertex Cover
|
0 / 0 |
10 |
|
|
888 |
P1681F
Unique Occurrences
|
0 / 0 |
8 |
|
|
874 |
P1684H
Hard Cut
|
0 / 0 |
10 |
|
|
841 |
P1691D
Max GEQ Sum
|
0 / 0 |
6 |
|
|
827 |
P1693D
Decinc Dividing
|
0 / 0 |
10 |
|
|
813 |
P1696D
Permutation Graph
|
0 / 0 |
6 |
|
|
732 |
P1706E
Qpwoeirut and Vertices
|
0 / 0 |
8 |
|
|
686 |
P1715E
Long Way Home
|
0 / 0 |
9 |
|
|
680 |
P1716E
Swap and Maximum Block
|
0 / 0 |
9 |
|
|
653 |
P1721D
Maximum AND
|
0 / 0 |
6 |
|
|
604 |
P1730E
Maximums and Minimums
|
0 / 0 |
10 |
|
|
578 |
P1734F
Zeros and Ones
|
0 / 0 |
9 |
|
|
536 |
P1740I
Arranging Crystal Balls
|
0 / 0 |
10 |
|
|
532 |
P1741D
Masha and a Beautiful Tree
|
0 / 0 |
4 |
|
|
490 |
P1748E
Yet Another Array Counting Problem
|
0 / 0 |
8 |
|
|
478 |
P1750E
Bracket Cost
|
0 / 0 |
9 |
|
|
396 |
P1766E
Decomposition
|
0 / 0 |
8 |
|
|
376 |
P1770G
Koxia and Bracket
|
0 / 0 |
10 |
|
|
367 |
P1773B
BinCoin
|
0 / 0 |
8 |
|
|
321 |
P1777F
Comfortably Numb
|
0 / 0 |
9 |
|
|
285 |
P1783G
Weighed Tree Radius
|
0 / 0 |
10 |
|
|
267 |
P1787I
Treasure Hunt
|
0 / 0 |
10 |
|
|
249 |
P1790F
Timofey and Black-White Tree
|
0 / 0 |
7 |
|
|
233 |
P1792F2
Graph Coloring (hard version)
|
0 / 0 |
10 |
|
|
227 |
P1793F
Rebrending
|
0 / 0 |
10 |
|
|
223 |
P1794D
Counting Factorizations
|
0 / 0 |
6 |
|
|
203 |
P1797F
Li Hua and Path
|
0 / 0 |
10 |
|
|
174 |
P1801E
Gasoline prices
|
0 / 0 |
10 |
|
|
164 |
P1804F
Approximate Diameter
|
0 / 0 |
10 |
|
|
135 |
P1808E1
Minibuses on Venus (easy version)
|
0 / 0 |
8 |
|
|
134 |
P1808E2
Minibuses on Venus (medium version)
|
0 / 0 |
9 |
|
|
104 |
P1814F
Communication Towers
|
0 / 0 |
10 |
|
|
91 |
P1817E
Half-sum
|
0 / 0 |
10 |
|
|
3066 |
P1842I
Tenzing and Necklace
|
0 / 0 |
10 |
|
|
3059 |
P1843F2
Omsk Metro (hard version)
|
0 / 0 |
8 |
|
|
4343 |
P1848F
Vika and Wiki
|
0 / 0 |
(无) |
|
|
4836 |
P1849E
Max to the Right of Min
|
0 / 0 |
(无) |
|
|
4835 |
P1849F
XOR Partition
|
0 / 0 |
(无) |
|
|
7730 |
P1856D
More Wrong
|
0 / 0 |
(无) |
|
|
8783 |
P1857G
Counting Graphs
|
0 / 0 |
(无) |
|
|
8790 |
P1859F
Teleportation in Byteland
|
0 / 0 |
(无) |
|
|
8899 |
P1879D
Sum of XOR Functions
|
0 / 0 |
5 |
|
|
8944 |
P1887D
Split
|
0 / 0 |
(无) |
|
|
9026 |
P1896D
Ones and Twos
|
0 / 0 |
5 |
|
|
9022 |
P1896H1
Cyclic Hamming (Easy Version)
|
0 / 0 |
10 |
