|
|
582 |
P1862E
Kolya and Movie Theatre
|
0 / 0 |
5 |
|
|
576 |
P1863D
Two-Colored Dominoes
|
0 / 0 |
4 |
|
|
571 |
P1863I
Redundant Routes
|
0 / 0 |
10 |
|
|
570 |
P1864A
Increasing and Decreasing
|
0 / 0 |
3 |
|
|
569 |
P1864B
Swap and Reverse
|
0 / 0 |
3 |
|
|
568 |
P1864C
Divisor Chain
|
0 / 0 |
4 |
|
|
567 |
P1864D
Matrix Cascade
|
0 / 0 |
5 |
|
|
564 |
P1864G
Magic Square
|
0 / 0 |
10 |
|
|
548 |
P1867A
green_gold_dog, array and permutation
|
0 / 0 |
3 |
|
|
547 |
P1867B
XOR Palindromes
|
0 / 0 |
3 |
|
|
546 |
P1867C
Salyg1n and the MEX Game
|
0 / 0 |
4 |
|
|
545 |
P1867D
Cyclic Operations
|
0 / 0 |
6 |
|
|
544 |
P1867E1
Salyg1n and Array (simple version)
|
0 / 0 |
7 |
|
|
543 |
P1867E2
Salyg1n and Array (hard version)
|
0 / 0 |
8 |
|
|
542 |
P1867F
Most Different Tree
|
0 / 0 |
10 |
|
|
541 |
P1868A
Fill in the Matrix
|
0 / 0 |
4 |
|
|
540 |
P1868B1
Candy Party (Easy Version)
|
0 / 0 |
5 |
|
|
539 |
P1868B2
Candy Party (Hard Version)
|
0 / 0 |
7 |
|
|
537 |
P1868D
Flower-like Pseudotree
|
0 / 0 |
10 |
|
|
536 |
P1868E
Min-Sum-Max
|
0 / 0 |
10 |
|
|
534 |
P1869A
Make It Zero
|
0 / 0 |
3 |
|
|
532 |
P1870A
MEXanized Array
|
0 / 0 |
3 |
|
|
511 |
P1873G
ABBC or BACB
|
0 / 0 |
5 |
|
|
497 |
P1876C
Autosynthesis
|
0 / 0 |
7 |
|
|
495 |
P1876E
Ball-Stackable
|
0 / 0 |
10 |
|
|
489 |
P1878B
Aleksa and Stack
|
0 / 0 |
3 |
|
|
482 |
P1879B
Chips on the Board
|
0 / 0 |
3 |
|
|
479 |
P1879E
Interactive Game with Coloring
|
0 / 0 |
9 |
|
|
469 |
P1882B
Sets and Union
|
0 / 0 |
4 |
|
|
466 |
P1882E1
Two Permutations (Easy Version)
|
0 / 0 |
9 |
|
|
465 |
P1882E2
Two Permutations (Hard Version)
|
0 / 0 |
10 |
|
|
450 |
P1886A
Sum of Three
|
0 / 0 |
3 |
|
|
446 |
P1886E
I Wanna be the Team Leader
|
0 / 0 |
9 |
|
|
443 |
P1887C
Minimum Array
|
0 / 0 |
9 |
|
|
441 |
P1887E
Good Colorings
|
0 / 0 |
10 |
|
|
440 |
P1887F
Minimum Segments
|
0 / 0 |
10 |
|
|
439 |
P1889A
Qingshan Loves Strings 2
|
0 / 0 |
4 |
|
|
438 |
P1889B
Doremy's Connecting Plan
|
0 / 0 |
5 |
|
|
432 |
P1890A
Doremy's Paint 3
|
0 / 0 |
3 |
|
|
431 |
P1890B
Qingshan Loves Strings
|
0 / 0 |
3 |
|
|
430 |
P1891A
Sorting with Twos
|
0 / 0 |
3 |
|
|
428 |
P1891C
Smilo and Monsters
|
0 / 0 |
5 |
|
|
423 |
P1893B
Neutral Tonality
|
0 / 0 |
5 |
|
|
421 |
P1893D
Colorful Constructive
|
0 / 0 |
10 |
|
|
418 |
P1894B
Two Out of Three
|
0 / 0 |
3 |
|
|
414 |
P1895D
XOR Construction
|
0 / 0 |
6 |
|
|
408 |
P1896C
Matching Arrays
|
0 / 0 |
4 |
|
|
405 |
P1896F
Bracket Xoring
|
0 / 0 |
10 |
|
|
404 |
P1896G
Pepe Racing
|
0 / 0 |
10 |
|
|
399 |
P1898C
Colorful Grid
|
0 / 0 |
5 |
|
|
390 |
P1899F
Alex's whims
|
0 / 0 |
5 |
|
|
388 |
P1900A
Cover in Water
|
0 / 0 |
3 |
|
|
380 |
P1901C
Add, Divide and Floor
|
0 / 0 |
4 |
|
|
376 |
P1902A
Binary Imbalance
|
0 / 0 |
3 |
|
|
374 |
P1902C
Insert and Equalize
|
0 / 0 |
4 |
|
|
369 |
P1903B
StORage room
|
0 / 0 |
4 |
|
|
368 |
P1903C
Theofanis' Nightmare
|
0 / 0 |
4 |
|
|
360 |
P1904D1
Set To Max (Easy Version)
|
0 / 0 |
5 |
|
|
359 |
P1904D2
Set To Max (Hard Version)
|
0 / 0 |
6 |
|
|
356 |
P1905A
Constructive Problems
|
0 / 0 |
3 |
|
|
349 |
P1906B
Button Pressing
|
0 / 0 |
10 |
|
|
346 |
P1906E
Merge Not Sort
|
0 / 0 |
6 |
|
|
339 |
P1906L
Palindromic Parentheses
|
0 / 0 |
9 |
|
|
335 |
P1907C
Removal of Unattractive Pairs
|
0 / 0 |
4 |
|
|
334 |
P1907D
Jumping Through Segments
|
0 / 0 |
4 |
|
|
331 |
P1907G
Lights
|
0 / 0 |
8 |
|
|
329 |
P1909B
Make Almost Equal With Mod
|
0 / 0 |
4 |
|
|
328 |
P1909C
Heavy Intervals
|
0 / 0 |
4 |
|
|
326 |
P1909E
Multiple Lamps
|
0 / 0 |
9 |
|
|
322 |
P1909H
Parallel Swaps Sort
|
0 / 0 |
10 |
|
|
306 |
P1912E
Evaluate It and Back Again
|
0 / 0 |
8 |
|
|
291 |
P1914B
Preparing for the Contest
|
0 / 0 |
3 |
|
|
276 |
P1916A
2023
|
0 / 0 |
3 |
|
|
275 |
P1916B
Two Divisors
|
0 / 0 |
3 |
|
|
274 |
P1916C
Training Before the Olympiad
|
0 / 0 |
4 |
|
|
273 |
P1916D
Mathematical Problem
|
0 / 0 |
5 |
|
|
271 |
P1916F
Group Division
|
0 / 0 |
10 |
|
|
267 |
P1917A
Least Product
|
0 / 0 |
3 |
|
|
263 |
P1917E
Construct Matrix
|
0 / 0 |
9 |
|
|
262 |
P1917F
Construct Tree
|
0 / 0 |
9 |
|
|
261 |
P1918A
Brick Wall
|
0 / 0 |
3 |
|
|
260 |
P1918B
Minimize Inversions
|
0 / 0 |
3 |
|
|
257 |
P1918E
ace5 and Task Order
|
0 / 0 |
8 |
|
|
255 |
P1918G
Permutation of Given
|
0 / 0 |
10 |
|
|
251 |
P1919D
01 Tree
|
0 / 0 |
7 |
|
|
250 |
P1919E
Counting Prefixes
|
0 / 0 |
10 |
|
|
247 |
P1919G
Tree LGM
|
0 / 0 |
10 |
|
|
231 |
P1922A
Tricky Template
|
0 / 0 |
3 |
|
|
230 |
P1922B
Forming Triangles
|
0 / 0 |
4 |
|
|
227 |
P1922E
Increasing Subsequences
|
0 / 0 |
6 |
|
|
223 |
P1923C
Find B
|
0 / 0 |
4 |
|
|
222 |
P1923D
Slimes
|
0 / 0 |
6 |
|
|
219 |
P1924A
Did We Get Everything Covered?
|
0 / 0 |
5 |
|
|
214 |
P1924F
Anti-Proxy Attendance
|
0 / 0 |
10 |
|
|
213 |
P1925A
We Got Everything Covered!
|
0 / 0 |
3 |
|
|
202 |
P1927B
Following the String
|
0 / 0 |
3 |
|
|
199 |
P1927E
Klever Permutation
|
0 / 0 |
4 |
|
|
192 |
P1928E
Modular Sequence
|
0 / 0 |
8 |
|
|
190 |
P1929A
Sasha and the Beautiful Array
|
0 / 0 |
3 |
|
|
189 |
P1929B
Sasha and the Drawing
|
0 / 0 |
3 |
