|
|
1755 |
P1663B
Mike's Sequence
|
0 / 0 |
(无) |
|
|
1744 |
P1665E
MinimizOR
|
0 / 0 |
9 |
|
|
1705 |
P1671E
Preorder
|
0 / 0 |
7 |
|
|
1688 |
P1673F
Anti-Theft Road Planning
|
0 / 0 |
9 |
|
|
1665 |
P1676H2
Maximum Crossings (Hard Version)
|
0 / 0 |
5 |
|
|
1644 |
P1680F
Lenient Vertex Cover
|
0 / 0 |
10 |
|
|
1638 |
P1681F
Unique Occurrences
|
0 / 0 |
8 |
|
|
1624 |
P1684H
Hard Cut
|
0 / 0 |
10 |
|
|
1591 |
P1691D
Max GEQ Sum
|
0 / 0 |
6 |
|
|
1577 |
P1693D
Decinc Dividing
|
0 / 0 |
10 |
|
|
1563 |
P1696D
Permutation Graph
|
0 / 0 |
6 |
|
|
1493 |
P1706E
Qpwoeirut and Vertices
|
0 / 0 |
8 |
|
|
1447 |
P1715E
Long Way Home
|
0 / 0 |
9 |
|
|
1441 |
P1716E
Swap and Maximum Block
|
0 / 0 |
9 |
|
|
1414 |
P1721D
Maximum AND
|
0 / 0 |
6 |
|
|
1365 |
P1730E
Maximums and Minimums
|
0 / 0 |
10 |
|
|
1339 |
P1734F
Zeros and Ones
|
0 / 0 |
9 |
|
|
1297 |
P1740I
Arranging Crystal Balls
|
0 / 0 |
10 |
|
|
1293 |
P1741D
Masha and a Beautiful Tree
|
0 / 0 |
4 |
|
|
1251 |
P1748E
Yet Another Array Counting Problem
|
0 / 0 |
8 |
|
|
1239 |
P1750E
Bracket Cost
|
0 / 0 |
9 |
|
|
1157 |
P1766E
Decomposition
|
0 / 0 |
8 |
|
|
1137 |
P1770G
Koxia and Bracket
|
0 / 0 |
10 |
|
|
1128 |
P1773B
BinCoin
|
0 / 0 |
8 |
|
|
1082 |
P1777F
Comfortably Numb
|
0 / 0 |
9 |
|
|
1046 |
P1783G
Weighed Tree Radius
|
0 / 0 |
10 |
|
|
1028 |
P1787I
Treasure Hunt
|
0 / 0 |
10 |
|
|
1010 |
P1790F
Timofey and Black-White Tree
|
0 / 0 |
7 |
|
|
994 |
P1792F2
Graph Coloring (hard version)
|
0 / 0 |
10 |
|
|
988 |
P1793F
Rebrending
|
0 / 0 |
10 |
|
|
984 |
P1794D
Counting Factorizations
|
0 / 0 |
6 |
|
|
964 |
P1797F
Li Hua and Path
|
0 / 0 |
10 |
|
|
935 |
P1801E
Gasoline prices
|
0 / 0 |
10 |
|
|
925 |
P1804F
Approximate Diameter
|
0 / 0 |
10 |
|
|
896 |
P1808E1
Minibuses on Venus (easy version)
|
0 / 0 |
8 |
|
|
895 |
P1808E2
Minibuses on Venus (medium version)
|
0 / 0 |
9 |
|
|
855 |
P1814F
Communication Towers
|
0 / 0 |
10 |
|
|
842 |
P1817E
Half-sum
|
0 / 0 |
10 |
|
|
704 |
P1842I
Tenzing and Necklace
|
0 / 0 |
10 |
|
|
697 |
P1843F2
Omsk Metro (hard version)
|
0 / 0 |
8 |
|
|
662 |
P1848F
Vika and Wiki
|
0 / 0 |
9 |
|
|
657 |
P1849E
Max to the Right of Min
|
0 / 0 |
8 |
|
|
656 |
P1849F
XOR Partition
|
0 / 0 |
10 |
|
|
620 |
P1856D
More Wrong
|
0 / 0 |
7 |
|
|
611 |
P1857G
Counting Graphs
|
0 / 0 |
7 |
|
|
599 |
P1859F
Teleportation in Byteland
|
0 / 0 |
10 |
|
|
506 |
P1874D
Jellyfish and Miku
|
0 / 0 |
10 |
|
|
480 |
P1879D
Sum of XOR Functions
|
0 / 0 |
5 |
|
|
442 |
P1887D
Split
|
0 / 0 |
10 |
|
|
407 |
P1896D
Ones and Twos
|
0 / 0 |
5 |
|
|
403 |
P1896H1
Cyclic Hamming (Easy Version)
|
0 / 0 |
10 |
|
|
396 |
P1898F
Vova Escapes the Matrix
|
0 / 0 |
10 |
|
|
371 |
P1902F
Trees and XOR Queries Again
|
0 / 0 |
9 |
|
|
366 |
P1903D2
Maximum And Queries (hard version)
|
0 / 0 |
9 |
|
|
359 |
P1904D2
Set To Max (Hard Version)
|
0 / 0 |
6 |
|
|
351 |
P1905F
Field Should Not Be Empty
|
0 / 0 |
10 |
|
|
340 |
P1906K
Deck-Building Game
|
0 / 0 |
9 |
|
|
309 |
P1912B
Blueprint for Seating
|
0 / 0 |
7 |
|
|
295 |
P1913D
Array Collapse
|
0 / 0 |
7 |
|
|
278 |
P1915F
Greetings
|
0 / 0 |
5 |
|
|
270 |
P1916G
Optimizations From Chelsu
|
0 / 0 |
10 |
|
|
257 |
P1918E
ace5 and Task Order
|
0 / 0 |
8 |
|
|
247 |
P1919G
Tree LGM
|
0 / 0 |
10 |
|
|
232 |
P1921G
Mischievous Shooter
|
0 / 0 |
8 |
|
|
227 |
P1922E
Increasing Subsequences
|
0 / 0 |
6 |
|
|
180 |
P1930D2
Sum over all Substrings (Hard Version)
|
0 / 0 |
7 |
|
|
137 |
P1936E
Yet Yet Another Permutation Problem
|
0 / 0 |
10 |
|
|
43 |
P1951E
No Palindromes
|
0 / 0 |
7 |
|
|
11 |
P1956D
Nene and the Mex Operator
|
0 / 0 |
7 |
|
|
9491 |
P1975F
Set
|
0 / 0 |
10 |
|
|
9484 |
P1976D
Invertible Bracket Sequences
|
0 / 0 |
7 |
|
|
9446 |
P1982E
Number of k-good subarrays
|
0 / 0 |
(无) |
