|
|
1297 |
P1663B
Mike's Sequence
|
0 / 0 |
(无) |
|
|
1286 |
P1665E
MinimizOR
|
0 / 0 |
9 |
|
|
1247 |
P1671E
Preorder
|
0 / 0 |
7 |
|
|
1230 |
P1673F
Anti-Theft Road Planning
|
0 / 0 |
9 |
|
|
1207 |
P1676H2
Maximum Crossings (Hard Version)
|
0 / 0 |
5 |
|
|
1186 |
P1680F
Lenient Vertex Cover
|
0 / 0 |
10 |
|
|
1180 |
P1681F
Unique Occurrences
|
0 / 0 |
8 |
|
|
1166 |
P1684H
Hard Cut
|
0 / 0 |
10 |
|
|
1133 |
P1691D
Max GEQ Sum
|
0 / 0 |
6 |
|
|
1119 |
P1693D
Decinc Dividing
|
0 / 0 |
10 |
|
|
1105 |
P1696D
Permutation Graph
|
0 / 0 |
6 |
|
|
1035 |
P1706E
Qpwoeirut and Vertices
|
0 / 0 |
8 |
|
|
989 |
P1715E
Long Way Home
|
0 / 0 |
9 |
|
|
983 |
P1716E
Swap and Maximum Block
|
0 / 0 |
9 |
|
|
956 |
P1721D
Maximum AND
|
0 / 0 |
6 |
|
|
907 |
P1730E
Maximums and Minimums
|
0 / 0 |
10 |
|
|
881 |
P1734F
Zeros and Ones
|
0 / 0 |
9 |
|
|
839 |
P1740I
Arranging Crystal Balls
|
0 / 0 |
10 |
|
|
835 |
P1741D
Masha and a Beautiful Tree
|
0 / 0 |
4 |
|
|
793 |
P1748E
Yet Another Array Counting Problem
|
0 / 0 |
8 |
|
|
781 |
P1750E
Bracket Cost
|
0 / 0 |
9 |
|
|
699 |
P1766E
Decomposition
|
0 / 0 |
8 |
|
|
679 |
P1770G
Koxia and Bracket
|
0 / 0 |
10 |
|
|
670 |
P1773B
BinCoin
|
0 / 0 |
8 |
|
|
624 |
P1777F
Comfortably Numb
|
0 / 0 |
9 |
|
|
588 |
P1783G
Weighed Tree Radius
|
0 / 0 |
10 |
|
|
570 |
P1787I
Treasure Hunt
|
0 / 0 |
10 |
|
|
552 |
P1790F
Timofey and Black-White Tree
|
0 / 0 |
7 |
|
|
536 |
P1792F2
Graph Coloring (hard version)
|
0 / 0 |
10 |
|
|
530 |
P1793F
Rebrending
|
0 / 0 |
10 |
|
|
526 |
P1794D
Counting Factorizations
|
0 / 0 |
6 |
|
|
506 |
P1797F
Li Hua and Path
|
0 / 0 |
10 |
|
|
477 |
P1801E
Gasoline prices
|
0 / 0 |
10 |
|
|
467 |
P1804F
Approximate Diameter
|
0 / 0 |
10 |
|
|
438 |
P1808E1
Minibuses on Venus (easy version)
|
0 / 0 |
8 |
|
|
437 |
P1808E2
Minibuses on Venus (medium version)
|
0 / 0 |
9 |
|
|
397 |
P1814F
Communication Towers
|
0 / 0 |
10 |
|
|
384 |
P1817E
Half-sum
|
0 / 0 |
10 |
|
|
246 |
P1842I
Tenzing and Necklace
|
0 / 0 |
10 |
|
|
239 |
P1843F2
Omsk Metro (hard version)
|
0 / 0 |
8 |
|
|
204 |
P1848F
Vika and Wiki
|
0 / 0 |
9 |
|
|
199 |
P1849E
Max to the Right of Min
|
0 / 0 |
8 |
|
|
198 |
P1849F
XOR Partition
|
0 / 0 |
10 |
|
|
162 |
P1856D
More Wrong
|
0 / 0 |
7 |
|
|
153 |
P1857G
Counting Graphs
|
0 / 0 |
7 |
|
|
141 |
P1859F
Teleportation in Byteland
|
0 / 0 |
10 |
|
|
48 |
P1874D
Jellyfish and Miku
|
0 / 0 |
(无) |
|
|
22 |
P1879D
Sum of XOR Functions
|
0 / 0 |
5 |
|
|
9025 |
P1896H1
Cyclic Hamming (Easy Version)
|
0 / 0 |
(无) |
|
|
9101 |
P1902F
Trees and XOR Queries Again
|
0 / 0 |
9 |
|
|
9096 |
P1903D2
Maximum And Queries (hard version)
|
0 / 0 |
9 |
|
|
9089 |
P1904D2
Set To Max (Hard Version)
|
0 / 0 |
(无) |
|
|
9082 |
P1905E
One-X
|
0 / 0 |
(无) |
|
|
9081 |
P1905F
Field Should Not Be Empty
|
0 / 0 |
(无) |
|
|
9070 |
P1906K
Deck-Building Game
|
0 / 0 |
9 |
|
|
9049 |
P1912B
Blueprint for Seating
|
0 / 0 |
7 |
|
|
9035 |
P1913D
Array Collapse
|
0 / 0 |
(无) |
|
|
9132 |
P1915F
Greetings
|
0 / 0 |
5 |
|
|
9124 |
P1916G
Optimizations From Chelsu
|
0 / 0 |
10 |
|
|
9188 |
P1918E
ace5 and Task Order
|
0 / 0 |
8 |
|
|
9153 |
P1919D
01 Tree
|
0 / 0 |
7 |
|
|
9163 |
P1921G
Mischievous Shooter
|
0 / 0 |
8 |
|
|
9158 |
P1922E
Increasing Subsequences
|
0 / 0 |
6 |
|
|
9244 |
P1923E
Count Paths
|
0 / 0 |
(无) |
|
|
9252 |
P1936E
Yet Yet Another Permutation Problem
|
0 / 0 |
(无) |
|
|
9366 |
P1952F
Grid
|
0 / 0 |
(无) |
|
|
9362 |
P1952J
Help, what does it mean to be "Based"
|
0 / 0 |
(无) |
|
|
9398 |
P1956D
Nene and the Mex Operator
|
0 / 0 |
(无) |
|
|
9496 |
P1975F
Set
|
0 / 0 |
(无) |
|
|
9566 |
P1982E
Number of k-good subarrays
|
0 / 0 |
(无) |
|
|
9590 |
P1983D
Swap Dilemma
|
1 / 1 |
10 |
|
|
9588 |
P1983F
array-value
|
0 / 0 |
(无) |
|
|
9571 |
P1989F
Simultaneous Coloring
|
0 / 0 |
(无) |
