|
|
10189 |
P1901B Chip and Ribbon
|
0 / 0 |
3 |
|
|
10188 |
P1901C Add, Divide and Floor
|
0 / 0 |
4 |
|
|
10187 |
P1901D Yet Another Monster Fight
|
0 / 0 |
5 |
|
|
10186 |
P1901E Compressed Tree
|
0 / 0 |
8 |
|
|
10185 |
P1901F Landscaping
|
0 / 0 |
10 |
|
|
10318 |
P1907F Shift and Reverse
|
0 / 0 |
6 |
|
|
10317 |
P1907G Lights
|
0 / 0 |
8 |
|
|
10316 |
P1909A Distinct Buttons
|
0 / 0 |
3 |
|
|
10315 |
P1909B Make Almost Equal With Mod
|
0 / 0 |
4 |
|
|
10314 |
P1909C Heavy Intervals
|
0 / 0 |
4 |
|
|
10313 |
P1909D Split Plus K
|
0 / 0 |
6 |
|
|
10312 |
P1909E Multiple Lamps
|
0 / 0 |
9 |
|
|
10311 |
P1909F1 Small Permutation Problem (Easy Version)
|
0 / 0 |
8 |
|
|
10310 |
P1909F2 Small Permutation Problem (Hard Version)
|
0 / 0 |
9 |
|
|
10309 |
P1909G Pumping Lemma
|
0 / 0 |
10 |
|
|
10308 |
P1909H Parallel Swaps Sort
|
0 / 0 |
10 |
|
|
10307 |
P1909I Short Permutation Problem
|
0 / 0 |
10 |
|
|
10306 |
P1910A Username
|
0 / 0 |
3 |
|
|
10305 |
P1910B Security Guard
|
0 / 0 |
5 |
|
|
10304 |
P1910C Poisonous Swamp
|
0 / 0 |
5 |
|
|
10303 |
P1910D Remove and Add
|
0 / 0 |
6 |
|
|
10302 |
P1910E Maximum Sum Subarrays
|
0 / 0 |
7 |
|
|
10301 |
P1910F Build Railway Stations
|
0 / 0 |
7 |
|
|
10300 |
P1910G Pool Records
|
0 / 0 |
10 |
|
|
10299 |
P1910H Sum of Digits of Sums
|
0 / 0 |
9 |
|
|
10298 |
P1910I Inverse Problem
|
0 / 0 |
10 |
|
|
10297 |
P1910J Two Colors
|
0 / 0 |
10 |
|
|
10296 |
P1912A Accumulator Apex
|
0 / 0 |
6 |
|
|
10295 |
P1912B Blueprint for Seating
|
0 / 0 |
7 |
|
|
10294 |
P1912C __NO_TITLE__
|
0 / 0 |
(None) |
|
|
10248 |
P1912D Divisibility Test
|
0 / 0 |
6 |
|
|
10247 |
P1912E Evaluate It and Back Again
|
0 / 0 |
8 |
|
|
10246 |
P1912F Fugitive Frenzy
|
0 / 0 |
10 |
|
|
10245 |
P1912G __NO_TITLE__
|
0 / 0 |
(None) |
|
|
10244 |
P1912H Hypercatapult Commute
|
0 / 0 |
9 |
|
|
10243 |
P1912I __NO_TITLE__
|
0 / 0 |
(None) |
|
|
10242 |
P1912J __NO_TITLE__
|
0 / 0 |
(None) |
|
|
10241 |
P1912K Kim's Quest
|
0 / 0 |
6 |
|
|
10240 |
P1912L LOL Lovers
|
0 / 0 |
3 |
|
|
10239 |
P1913A Rating Increase
|
0 / 0 |
3 |
|
|
10238 |
P1913B Swap and Delete
|
0 / 0 |
3 |
|
|
10237 |
P1913C Game with Multiset
|
0 / 0 |
4 |
|
|
10236 |
P1913D Array Collapse
|
0 / 0 |
7 |
|
|
10235 |
P1913E Matrix Problem
|
0 / 0 |
9 |
|
|
10234 |
P1913F Palindromic Problem
|
0 / 0 |
10 |
|
|
10233 |
P1914A Problemsolving Log
|
0 / 0 |
3 |
|
|
10232 |
P1914B Preparing for the Contest
|
0 / 0 |
3 |
|
|
10231 |
P1914C Quests
|
0 / 0 |
3 |
|
|
10230 |
P1914D Three Activities
|
0 / 0 |
4 |
|
|
10229 |
P1914E1 Game with Marbles (Easy Version)
|
0 / 0 |
4 |
|
|
10228 |
P1914E2 Game with Marbles (Hard Version)
|
0 / 0 |
4 |
|
|
10227 |
P1914F Programming Competition
|
0 / 0 |
6 |
|
|
10226 |
P1914G1 Light Bulbs (Easy Version)
|
0 / 0 |
7 |
|
|
10225 |
P1914G2 Light Bulbs (Hard Version)
|
0 / 0 |
8 |
|
|
10293 |
P1915A Odd One Out
|
0 / 0 |
3 |
|
|
10292 |
P1915B Not Quite Latin Square
|
0 / 0 |
3 |
|
|
10291 |
P1915C Can I Square?
|
0 / 0 |
3 |
|
|
10290 |
P1915D Unnatural Language Processing
|
0 / 0 |
3 |
|
|
10289 |
P1915E Romantic Glasses
|
0 / 0 |
4 |
|
|
10288 |
P1915F Greetings
|
0 / 0 |
5 |
|
|
10287 |
P1915G Bicycles
|
0 / 0 |
6 |
|
|
10286 |
P1916A 2023
|
0 / 0 |
3 |
|
|
10285 |
P1916B Two Divisors
|
0 / 0 |
3 |
|
|
10284 |
P1916C Training Before the Olympiad
|
0 / 0 |
4 |
|
|
10283 |
P1916D Mathematical Problem
|
0 / 0 |
5 |
|
|
10282 |
P1916E Happy Life in University
|
0 / 0 |
8 |
|
|
10281 |
P1916F Group Division
|
0 / 0 |
10 |
|
|
10280 |
P1916G Optimizations From Chelsu
|
0 / 0 |
10 |
|
|
10279 |
P1916H1 Matrix Rank (Easy Version)
|
0 / 0 |
10 |
|
|
10278 |
P1916H2 Matrix Rank (Hard Version)
|
0 / 0 |
10 |
|
|
10224 |
P1917A Least Product
|
0 / 0 |
3 |
|
|
10223 |
P1917B Erase First or Second Letter
|
0 / 0 |
3 |
|
|
10222 |
P1917C Watering an Array
|
0 / 0 |
5 |
|
|
10221 |
P1917D Yet Another Inversions Problem
|
0 / 0 |
8 |
|
|
10220 |
P1917E Construct Matrix
|
0 / 0 |
9 |
|
|
10219 |
P1917F Construct Tree
|
0 / 0 |
9 |
|
|
10347 |
P1918A Brick Wall
|
0 / 0 |
3 |
|
|
10346 |
P1918B Minimize Inversions
|
0 / 0 |
3 |
|
|
10345 |
P1918C XOR-distance
|
0 / 0 |
4 |
|
|
10344 |
P1918D Blocking Elements
|
0 / 0 |
6 |
|
|
10343 |
P1918E ace5 and Task Order
|
0 / 0 |
8 |
|
|
10342 |
P1918F Caterpillar on a Tree
|
0 / 0 |
9 |
|
|
10341 |
P1918G Permutation of Given
|
0 / 0 |
10 |
|
|
10277 |
P1919A Wallet Exchange
|
0 / 0 |
3 |
|
|
10276 |
P1919B Plus-Minus Split
|
0 / 0 |
3 |
|
|
10275 |
P1919C Grouping Increases
|
0 / 0 |
4 |
|
|
10274 |
P1919D 01 Tree
|
0 / 0 |
7 |
|
|
10273 |
P1919E Counting Prefixes
|
0 / 0 |
10 |
|
|
10272 |
P1919F1 Wine Factory (Easy Version)
|
0 / 0 |
8 |
|
|
10271 |
P1919F2 Wine Factory (Hard Version)
|
0 / 0 |
10 |
|
|
10270 |
P1919G Tree LGM
|
0 / 2 |
10 |
|
|
10269 |
P1919H Tree Diameter
|
0 / 0 |
10 |
|
|
10268 |
P1920A Satisfying Constraints
|
0 / 0 |
3 |
|
|
10267 |
P1920B Summation Game
|
0 / 0 |
3 |
|
|
10266 |
P1920C Partitioning the Array
|
0 / 0 |
5 |
|
|
10265 |
P1920D Array Repetition
|
0 / 0 |
6 |
|
|
10264 |
P1920E Counting Binary Strings
|
0 / 0 |
7 |
|
|
10263 |
P1920F1 Smooth Sailing (Easy Version)
|
0 / 0 |
9 |
|
|
10262 |
P1920F2 Smooth Sailing (Hard Version)
|
0 / 0 |
10 |
|
|
10261 |
P1921A Square
|
0 / 0 |
3 |
