|
|
523 |
P1663B
Mike's Sequence
|
0 / 0 |
(无) |
|
|
512 |
P1665E
MinimizOR
|
0 / 0 |
9 |
|
|
473 |
P1671E
Preorder
|
0 / 0 |
7 |
|
|
456 |
P1673F
Anti-Theft Road Planning
|
0 / 0 |
9 |
|
|
433 |
P1676H2
Maximum Crossings (Hard Version)
|
0 / 0 |
5 |
|
|
412 |
P1680F
Lenient Vertex Cover
|
0 / 0 |
10 |
|
|
406 |
P1681F
Unique Occurrences
|
0 / 0 |
8 |
|
|
392 |
P1684H
Hard Cut
|
0 / 0 |
10 |
|
|
359 |
P1691D
Max GEQ Sum
|
0 / 0 |
6 |
|
|
345 |
P1693D
Decinc Dividing
|
0 / 0 |
10 |
|
|
331 |
P1696D
Permutation Graph
|
0 / 0 |
6 |
|
|
261 |
P1706E
Qpwoeirut and Vertices
|
0 / 0 |
8 |
|
|
215 |
P1715E
Long Way Home
|
0 / 0 |
9 |
|
|
209 |
P1716E
Swap and Maximum Block
|
0 / 0 |
9 |
|
|
182 |
P1721D
Maximum AND
|
0 / 0 |
6 |
|
|
133 |
P1730E
Maximums and Minimums
|
0 / 0 |
10 |
|
|
113 |
P1734F
Zeros and Ones
|
0 / 0 |
9 |
|
|
71 |
P1740I
Arranging Crystal Balls
|
0 / 0 |
10 |
|
|
67 |
P1741D
Masha and a Beautiful Tree
|
0 / 0 |
4 |
|
|
25 |
P1748E
Yet Another Array Counting Problem
|
0 / 0 |
8 |
|
|
13 |
P1750E
Bracket Cost
|
0 / 0 |
9 |
|
|
8308 |
P1770G
Koxia and Bracket
|
0 / 0 |
10 |
|
|
8299 |
P1773B
BinCoin
|
0 / 0 |
8 |
|
|
8292 |
P1777F
Comfortably Numb
|
0 / 0 |
(无) |
|
|
8230 |
P1783G
Weighed Tree Radius
|
0 / 0 |
(无) |
|
|
8322 |
P1787I
Treasure Hunt
|
0 / 0 |
(无) |
|
|
8316 |
P1790F
Timofey and Black-White Tree
|
0 / 0 |
(无) |
|
|
8270 |
P1792F2
Graph Coloring (hard version)
|
0 / 0 |
(无) |
|
|
8399 |
P1796D
Maximum Subarray
|
0 / 0 |
7 |
|
|
8435 |
P1801E
Gasoline prices
|
0 / 0 |
10 |
|
|
8425 |
P1804F
Approximate Diameter
|
0 / 0 |
10 |
|
|
8467 |
P1808E1
Minibuses on Venus (easy version)
|
0 / 0 |
8 |
|
|
8466 |
P1808E2
Minibuses on Venus (medium version)
|
0 / 0 |
9 |
|
|
8565 |
P1842I
Tenzing and Necklace
|
0 / 0 |
10 |
|
|
8558 |
P1843F2
Omsk Metro (hard version)
|
0 / 0 |
8 |
|
|
8523 |
P1848F
Vika and Wiki
|
0 / 0 |
9 |
|
|
8518 |
P1849E
Max to the Right of Min
|
0 / 0 |
(无) |
|
|
8517 |
P1849F
XOR Partition
|
0 / 0 |
(无) |
|
|
8628 |
P1856D
More Wrong
|
0 / 0 |
7 |
|
|
8619 |
P1857G
Counting Graphs
|
0 / 0 |
7 |
|
|
8607 |
P1859F
Teleportation in Byteland
|
0 / 0 |
10 |
|
|
8744 |
P1874D
Jellyfish and Miku
|
0 / 0 |
(无) |
|
|
8640 |
P1879D
Sum of XOR Functions
|
0 / 0 |
5 |
|
|
8772 |
P1887D
Split
|
0 / 0 |
(无) |
|
|
8811 |
P1896E
Permutation Sorting
|
0 / 0 |
(无) |
|
|
8808 |
P1896H1
Cyclic Hamming (Easy Version)
|
0 / 0 |
(无) |
|
|
8801 |
P1898F
Vova Escapes the Matrix
|
0 / 0 |
10 |
|
|
8845 |
P1903D2
Maximum And Queries (hard version)
|
0 / 0 |
9 |
|
|
8923 |
P1904D2
Set To Max (Hard Version)
|
0 / 0 |
6 |
|
|
8915 |
P1905F
Field Should Not Be Empty
|
0 / 0 |
10 |
|
|
8832 |
P1906K
Deck-Building Game
|
0 / 0 |
9 |
|
|
8893 |
P1912B
Blueprint for Seating
|
0 / 0 |
7 |
|
|
8879 |
P1913D
Array Collapse
|
0 / 0 |
7 |
|
|
8864 |
P1917D
Yet Another Inversions Problem
|
0 / 0 |
8 |
|
|
9014 |
P1921G
Mischievous Shooter
|
0 / 0 |
8 |
|
|
9009 |
P1922E
Increasing Subsequences
|
0 / 0 |
6 |
|
|
8962 |
P1930D2
Sum over all Substrings (Hard Version)
|
0 / 0 |
(无) |
|
|
8931 |
P1936E
Yet Yet Another Permutation Problem
|
0 / 0 |
(无) |
|
|
9121 |
P1951E
No Palindromes
|
0 / 0 |
7 |
|
|
9088 |
P1956D
Nene and the Mex Operator
|
0 / 0 |
7 |
|
|
9205 |
P1957F1
Frequency Mismatch (Easy Version)
|
0 / 0 |
10 |
|
|
9180 |
P1968G2
Division + LCP (hard version)
|
0 / 0 |
(无) |
|
|
9175 |
P1969E
Unique Array
|
0 / 0 |
(无) |
|
|
9345 |
P1975F
Set
|
0 / 0 |
10 |
|
|
9338 |
P1976D
Invertible Bracket Sequences
|
0 / 0 |
7 |
|
|
9300 |
P1982E
Number of k-good subarrays
|
0 / 0 |
8 |
|
|
9295 |
P1983D
Swap Dilemma
|
0 / 0 |
(无) |
|
|
9258 |
P1987G1
Spinning Round (Easy Version)
|
0 / 0 |
10 |
|
|
9257 |
P1987G2
Spinning Round (Hard Version)
|
0 / 0 |
10 |
|
|
9380 |
P1988E
Range Minimum Sum
|
0 / 0 |
8 |
|
|
9250 |
P1989F
Simultaneous Coloring
|
0 / 0 |
10 |
|
|
9372 |
P1990F
Polygonal Segments
|
0 / 0 |
(无) |
|
|
9410 |
P1997E
Level Up
|
0 / 0 |
(无) |
