|
|
997 |
P1574D
The Strongest Build
|
0 / 0 |
7 |
|
|
993 |
P1575B
Building an Amusement Park
|
0 / 0 |
8 |
|
|
985 |
P1575J
Jeopardy of Dropped Balls
|
0 / 0 |
5 |
|
|
969 |
P1578L
Labyrinth
|
0 / 0 |
9 |
|
|
947 |
P1582E
Pchelyonok and Segments
|
0 / 0 |
7 |
|
|
945 |
P1582F2
Korney Korneevich and XOR (hard version)
|
0 / 0 |
9 |
|
|
932 |
P1584D
Guess the Permutation
|
0 / 0 |
7 |
|
|
931 |
P1584E
Game with Stones
|
0 / 0 |
8 |
|
|
920 |
P1588F
Jumping Through the Array
|
0 / 0 |
10 |
|
|
919 |
P1592A
Gamer Hemose
|
0 / 0 |
3 |
|
|
916 |
P1592D
Hemose in ICPC ?
|
0 / 0 |
8 |
|
|
910 |
P1593C
Save More Mice
|
0 / 0 |
3 |
|
|
892 |
P1598F
RBS
|
0 / 0 |
9 |
|
|
872 |
P1601F
Two Sorts
|
0 / 0 |
10 |
|
|
857 |
P1605E
Array Equalizer
|
0 / 0 |
9 |
|
|
837 |
P1608E
The Cells on the Paper
|
0 / 0 |
10 |
|
|
835 |
P1608G
Alphabetic Tree
|
0 / 0 |
10 |
|
|
832 |
P1609C
Complex Market Analysis
|
0 / 0 |
4 |
|
|
824 |
P1610C
Keshi Is Throwing a Party
|
0 / 0 |
5 |
|
|
822 |
P1610E
AmShZ and G.O.A.T.
|
0 / 0 |
8 |
|
|
816 |
P1611B
Team Composition: Programmers and Mathematicians
|
0 / 0 |
3 |
|
|
811 |
P1611F
ATM and Students
|
0 / 0 |
6 |
|
|
807 |
P1612C
Chat Ban
|
0 / 0 |
4 |
|
|
800 |
P1613C
Poisoned Dagger
|
0 / 0 |
4 |
|
|
791 |
P1614E
Divan and a Cottage
|
0 / 0 |
10 |
|
|
783 |
P1615H
Reindeer Games
|
0 / 0 |
10 |
|
|
772 |
P1617C
Paprika and Permutation
|
0 / 0 |
4 |
|
|
758 |
P1619D
New Year's Problem
|
0 / 0 |
6 |
|
|
755 |
P1619G
Unusual Minesweeper
|
0 / 0 |
7 |
|
|
742 |
P1621E
New School
|
0 / 0 |
8 |
|
|
735 |
P1622C
Set or Decrease
|
0 / 0 |
5 |
|
|
729 |
P1623C
Balanced Stone Heaps
|
0 / 0 |
5 |
|
|
723 |
P1624D
Palindromes Coloring
|
0 / 0 |
4 |
|
|
721 |
P1624F
Interacdive Problem
|
0 / 0 |
7 |
|
|
714 |
P1625E2
Cats on the Upgrade (hard version)
|
0 / 0 |
10 |
|
|
711 |
P1626C
Monsters And Spells
|
0 / 0 |
5 |
|
|
710 |
P1626D
Martial Arts Tournament
|
0 / 0 |
7 |
|
|
701 |
P1628A
Meximum Array
|
0 / 0 |
4 |
|
|
696 |
P1628E
Groceries in Meteor Town
|
0 / 0 |
10 |
|
|
695 |
P1628F
Spaceship Crisis Management
|
0 / 0 |
10 |
|
|
691 |
P1630B
Range and Partition
|
0 / 0 |
6 |
|
|
682 |
P1632C
Strange Test
|
0 / 0 |
5 |
|
|
681 |
P1632D
New Year Concert
|
0 / 0 |
7 |
|
|
680 |
P1632E1
Distance Tree (easy version)
|
0 / 0 |
9 |
|
|
679 |
P1632E2
Distance Tree (hard version)
|
0 / 0 |
10 |
|
|
674 |
P1633E
Spanning Tree Queries
|
0 / 0 |
9 |
|
|
656 |
P1637E
Best Pair
|
0 / 0 |
7 |
|
|
633 |
P1641C
Anonymity Is Important
|
0 / 0 |
8 |
|
|
597 |
P1650E
Rescheduling the Exam
|
0 / 0 |
6 |
|
|
591 |
P1651D
Nearest Excluded Points
|
0 / 0 |
6 |
|
|
589 |
P1651F
Tower Defense
|
0 / 0 |
10 |
|
|
575 |
P1656F
Parametric MST
|
0 / 0 |
10 |
|
|
568 |
P1657D
For Gamers
|
0 / 0 |
7 |
|
|
556 |
P1659C
Line Empire
|
0 / 0 |
5 |
|
|
543 |
P1661C
Water the Trees
|
0 / 0 |
5 |
|
|
540 |
P1661F
Teleporters
|
0 / 0 |
10 |
|
|
514 |
P1665C
Tree Infection
|
0 / 0 |
5 |
|
|
507 |
P1666E
Even Split
|
0 / 0 |
9 |
|
|
486 |
P1669F
Eating Candies
|
0 / 0 |
3 |
|
|
480 |
P1670D
Very Suspicious
|
0 / 0 |
5 |
|
|
475 |
P1671C
Dolce Vita
|
0 / 0 |
4 |
|
|
467 |
P1672E
notepad.exe
|
0 / 0 |
8 |
|
|
451 |
P1674E
Breaking the Wall
|
0 / 0 |
7 |
|
|
437 |
P1676E
Eating Queries
|
0 / 0 |
3 |
|
|
420 |
P1679D
Toss a Coin to Your Graph...
|
0 / 0 |
6 |
|
|
415 |
P1680C
Binary String
|
0 / 0 |
5 |
|
|
395 |
P1684E
MEX vs DIFF
|
0 / 0 |
7 |
|
|
381 |
P1687C
Sanae and Giant Robot
|
0 / 0 |
9 |
|
|
380 |
P1687D
Cute number
|
0 / 0 |
10 |
|
|
365 |
P1690E
Price Maximization
|
0 / 0 |
5 |
|
|
363 |
P1690G
Count the Trains
|
0 / 0 |
7 |
|
|
359 |
P1691D
Max GEQ Sum
|
0 / 0 |
6 |
|
|
352 |
P1692E
Binary Deque
|
0 / 0 |
4 |
|
|
343 |
P1693F
I Might Be Wrong
|
0 / 0 |
10 |
|
|
331 |
P1696D
Permutation Graph
|
0 / 0 |
6 |
|
|
324 |
P1697C
awoo's Favorite Problem
|
0 / 0 |
4 |
|
|
323 |
P1697D
Guess The String
|
0 / 0 |
6 |
|
|
317 |
P1698D
Fixed Point Guessing
|
0 / 0 |
5 |
|
|
305 |
P1700D
River Locks
|
0 / 0 |
6 |
|
|
300 |
P1701C
Schedule Management
|
0 / 0 |
4 |
|
|
299 |
P1701D
Permutation Restoration
|
0 / 0 |
6 |
|
|
283 |
P1703F
Yet Another Problem About Pairs Satisfying an Inequality
|
0 / 0 |
4 |
|
|
268 |
P1705E
Mark and Professor Koro
|
0 / 0 |
8 |
|
|
263 |
P1706D1
Chopping Carrots (Easy Version)
|
0 / 0 |
5 |
|
|
261 |
P1706E
Qpwoeirut and Vertices
|
0 / 0 |
8 |
|
|
260 |
P1707A
Doremy's IQ
|
0 / 0 |
5 |
|
|
256 |
P1707E
Replace
|
0 / 0 |
10 |
|
|
249 |
P1709D
Rorororobot
|
0 / 0 |
5 |
|
|
245 |
P1710B
Rain
|
0 / 0 |
7 |
|
|
242 |
P1710E
Two Arrays
|
0 / 0 |
9 |
|
|
236 |
P1712D
Empty Graph
|
0 / 0 |
7 |
|
|
235 |
P1712E1
LCM Sum (easy version)
|
0 / 0 |
8 |
|
|
233 |
P1712F
Triameter
|
0 / 0 |
10 |
|
|
220 |
P1714G
Path Prefixes
|
0 / 0 |
5 |
|
|
192 |
P1719C
Fighting Tournament
|
0 / 0 |
4 |
|
|
183 |
P1721C
Min-Max Array Transformation
|
0 / 0 |
4 |
|
|
171 |
P1725B
Basketball Together
|
0 / 0 |
3 |
|
|
170 |
P1725C
Circular Mirror
|
0 / 0 |
7 |
|
|
169 |
P1725D
Deducing Sortability
|
0 / 0 |
10 |
|
|
166 |
P1725G
Garage
|
0 / 0 |
5 |
