|
|
601 |
P1753A2 Make Nonzero Sum (hard version)
|
0 / 0 |
普及
|
|
|
599 |
P1753C Wish I Knew How to Sort
|
0 / 0 |
提高
|
|
|
583 |
P1759E The Humanoid
|
0 / 0 |
普及
|
|
|
568 |
P1761F1 Anti-median (Easy Version)
|
0 / 0 |
CTSC
|
|
|
567 |
P1761F2 Anti-median (Hard Version)
|
0 / 0 |
CTSC
|
|
|
560 |
P1762F Good Pairs
|
0 / 0 |
CTSC
|
|
|
555 |
P1763D Valid Bitonic Permutations
|
0 / 0 |
省选
|
|
|
554 |
P1763E Node Pairs
|
0 / 0 |
省选
|
|
|
553 |
P1763F Edge Queries
|
0 / 0 |
CTSC
|
|
|
549 |
P1764D Doremy's Pegging Game
|
0 / 0 |
提高
|
|
|
548 |
P1764E Doremy's Number Line
|
0 / 0 |
NOI
|
|
|
540 |
P1765C Card Guessing
|
0 / 0 |
CTSC
|
|
|
537 |
P1765F Chemistry Lab
|
0 / 0 |
省选
|
|
|
526 |
P1766C Hamiltonian Wall
|
0 / 0 |
普及-
|
|
|
524 |
P1766E Decomposition
|
0 / 0 |
省选
|
|
|
520 |
P1767C Count Binary Strings
|
0 / 0 |
提高
|
|
|
519 |
P1767D Playoff
|
0 / 0 |
普及
|
|
|
518 |
P1767E Algebra Flash
|
0 / 0 |
NOI
|
|
|
511 |
P1768F Wonderful Jump
|
0 / 0 |
CTSC
|
|
|
506 |
P1770E Koxia and Tree
|
0 / 0 |
NOI
|
|
|
505 |
P1770F Koxia and Sequence
|
0 / 0 |
CTSC
|
|
|
501 |
P1771B Hossam and Friends
|
0 / 0 |
普及-
|
|
|
499 |
P1771D Hossam and (sub-)palindromic tree
|
0 / 0 |
提高
|
|
|
498 |
P1771E Hossam and a Letter
|
0 / 0 |
NOI
|
|
|
423 |
P1773G Game of Questions
|
0 / 0 |
CTSC
|
|
|
418 |
P1773L Lisa's Sequences
|
0 / 0 |
CTSC
|
|
|
415 |
P1774C Ice and Fire
|
0 / 0 |
普及-
|
|
|
413 |
P1774E Two Chess Pieces
|
0 / 0 |
普及
|
|
|
410 |
P1774G Segment Covering
|
0 / 0 |
CTSC
|
|
|
402 |
P1775F Laboratory on Pluto
|
0 / 0 |
NOI
|
|
|
400 |
P1776B Vittorio Plays with LEGO Bricks
|
0 / 0 |
省选
|
|
|
397 |
P1776E Crossing the Railways
|
0 / 0 |
CTSC
|
|
|
391 |
P1776K Uniform Chemistry
|
0 / 0 |
CTSC
|
|
|
389 |
P1776M Parmigiana With Seafood
|
0 / 0 |
CTSC
|
|
|
384 |
P1777D Score of a Tree
|
0 / 0 |
普及
|
|
|
378 |
P1778D Flexible String Revisit
|
0 / 0 |
提高
|
|
|
376 |
P1778F Maximizing Root
|
0 / 0 |
CTSC
|
|
|
372 |
P1779D Boris and His Amazing Haircut
|
0 / 0 |
普及
|
|
|
370 |
P1779F Xorcerer's Stones
|
0 / 0 |
NOI
|
|
|
363 |
P1780F Three Chairs
|
0 / 0 |
省选
|
|
|
356 |
P1781F Bracket Insertion
|
0 / 0 |
CTSC
|
|
|
349 |
P1783D Different Arrays
|
0 / 0 |
提高
|
|
|
342 |
P1784D Wooden Spoon
|
0 / 0 |
NOI
|
|
|
341 |
P1784E Infinite Game
|
0 / 0 |
CTSC
|
|
|
334 |
P1787C Remove the Bracket
|
0 / 0 |
普及
|
|
|
329 |
P1787H Codeforces Scoreboard
|
0 / 0 |
CTSC
|
|
|
323 |
P1788E Sum Over Zero
|
0 / 0 |
省选
|
|
|
319 |
P1789C Serval and Toxel's Arrays
|
0 / 0 |
普及
|
|
|
317 |
P1789E Serval and Music Game
|
0 / 0 |
NOI
|
|
|
316 |
P1789F Serval and Brain Power
|
0 / 0 |
CTSC
|
|
|
304 |
P1791E Negatives and Positives
|
0 / 0 |
普及-
|
|
|
296 |
P1792E Divisors and Table
|
0 / 0 |
NOI
|
|
|
295 |
P1792F1 Graph Coloring (easy version)
|
0 / 0 |
CTSC
|
|
|
294 |
P1792F2 Graph Coloring (hard version)
|
0 / 0 |
CTSC
|
|
|
290 |
P1793D Moscow Gorillas
|
0 / 0 |
普及
|
|
|
289 |
P1793E Velepin and Marketing
|
0 / 0 |
CTSC
|
|
|
284 |
P1794D Counting Factorizations
|
0 / 0 |
普及
|
|
|
283 |
P1794E Labeling the Tree with Distances
|
0 / 0 |
NOI
|
|
|
278 |
P1795E Explosions?
|
0 / 0 |
省选
|
|
|
272 |
P1796D Maximum Subarray
|
0 / 0 |
提高
|
|
|
271 |
P1796E Colored Subgraphs
|
0 / 0 |
NOI
|
|
|
266 |
P1797D Li Hua and Tree
|
0 / 0 |
普及
|
|
|
259 |
P1798E Multitest Generator
|
0 / 0 |
省选
|
|
|
258 |
P1798F Gifts from Grandfather Ahmed
|
0 / 0 |
NOI
|
|
|
254 |
P1799D1 Hot Start Up (easy version)
|
0 / 0 |
普及
|
|
|
253 |
P1799D2 Hot Start Up (hard version)
|
0 / 0 |
提高
|
|
|
251 |
P1799F Halve or Subtract
|
0 / 0 |
CTSC
|
|
|
250 |
P1799G Count Voting
|
0 / 0 |
CTSC
|
|
|
249 |
P1799H Tree Cutting
|
0 / 0 |
CTSC
|
|
|
237 |
P1801C Music Festival
|
0 / 0 |
普及
|
|
|
236 |
P1801D The way home
|
0 / 0 |
提高
|
|
|
234 |
P1801F Another n-dimensional chocolate bar
|
0 / 0 |
CTSC
|
|
|
227 |
P1804D Accommodation
|
0 / 0 |
提高
|
|
|
226 |
P1804E Routing
|
0 / 0 |
NOI
|
|
|
223 |
P1804H Code Lock
|
0 / 0 |
CTSC
|
|
|
219 |
P1805D A Wide, Wide Graph
|
0 / 0 |
普及
|
|
|
218 |
P1805E There Should Be a Lot of Maximums
|
0 / 0 |
省选
|
|
|
212 |
P1806D DSU Master
|
0 / 0 |
NOI
|
|
|
202 |
P1807G1 Subsequence Addition (Easy Version)
|
0 / 0 |
普及-
|
|
|
201 |
P1807G2 Subsequence Addition (Hard Version)
|
0 / 0 |
普及-
|
|
|
198 |
P1808C Unlucky Numbers
|
0 / 0 |
普及
|
|
|
196 |
P1808E1 Minibuses on Venus (easy version)
|
0 / 0 |
省选
|
|
|
195 |
P1808E2 Minibuses on Venus (medium version)
|
0 / 0 |
NOI
|
|
|
194 |
P1808E3 Minibuses on Venus (hard version)
|
0 / 0 |
CTSC
|
|
|
189 |
P1809E Two Tanks
|
0 / 0 |
NOI
|
|
|
187 |
P1809G Prediction
|
0 / 0 |
CTSC
|
|
|
180 |
P1810G The Maximum Prefix
|
0 / 0 |
CTSC
|
|
|
174 |
P1811E Living Sequence
|
0 / 0 |
普及
|
|
|
172 |
P1811G1 Vlad and the Nice Paths (easy version)
|
0 / 0 |
提高
|
|
|
171 |
P1811G2 Vlad and the Nice Paths (hard version)
|
0 / 0 |
省选
|
|
|
166 |
P1814E Chain Chips
|
0 / 0 |
省选
|
|
|
161 |
P1815D XOR Counting
|
0 / 0 |
CTSC
|
|
|
160 |
P1815E Bosco and Particle
|
0 / 0 |
CTSC
|
|
|
146 |
P1819C The Fox and the Complete Tree Traversal
|
0 / 0 |
NOI
|
|
|
145 |
P1819D Misha and Apples
|
0 / 0 |
CTSC
|
|
|
143 |
P1819F Willy-nilly, Crack, Into Release!
|
0 / 0 |
CTSC
|
|
|
136 |
P1821E Rearrange Brackets
|
0 / 0 |
提高
|
|
|
135 |
P1821F Timber
|
0 / 0 |
CTSC
|
|
|
129 |
P1822F Gardening Friends
|
0 / 0 |
普及
|
|
|
122 |
P1823E Removing Graph
|
0 / 0 |
NOI
|
