|
|
1189 |
P1593D2
Half of Same
|
0 / 0 |
6 |
|
|
1158 |
P1601A
Array Elimination
|
0 / 0 |
4 |
|
|
1150 |
P1603A
Di-visible Confusion
|
0 / 0 |
4 |
|
|
1149 |
P1603B
Moderate Modular Mode
|
0 / 0 |
5 |
|
|
1148 |
P1603C
Extreme Extension
|
0 / 0 |
8 |
|
|
1147 |
P1603D
Artistic Partition
|
0 / 0 |
10 |
|
|
1142 |
P1605A
A.M
|
0 / 0 |
3 |
|
|
1138 |
P1605E
Array Equalizer
|
0 / 0 |
9 |
|
|
1134 |
P1606C
Banknotes
|
0 / 0 |
4 |
|
|
1119 |
P1608D
Dominoes
|
0 / 0 |
9 |
|
|
1115 |
P1609A
Divide and Multiply
|
0 / 0 |
3 |
|
|
1113 |
P1609C
Complex Market Analysis
|
0 / 0 |
4 |
|
|
1104 |
P1610D
Not Quite Lee
|
0 / 0 |
7 |
|
|
1087 |
P1612D
X-Magic Pair
|
0 / 0 |
5 |
|
|
1074 |
P1614D1
Divan and Kostomuksha (easy version)
|
0 / 0 |
7 |
|
|
1073 |
P1614D2
Divan and Kostomuksha (hard version)
|
0 / 0 |
8 |
|
|
1054 |
P1617B
GCD Problem
|
0 / 0 |
3 |
|
|
1050 |
P1617E
Christmas Chocolates
|
0 / 0 |
10 |
|
|
1013 |
P1622F
Quadratic Set
|
0 / 0 |
10 |
|
|
989 |
P1626F
A Random Code Problem
|
0 / 0 |
10 |
|
|
986 |
P1627C
Not Assigning
|
0 / 0 |
4 |
|
|
985 |
P1627D
Not Adding
|
0 / 0 |
6 |
|
|
974 |
P1629B
GCD Arrays
|
0 / 0 |
3 |
|
|
970 |
P1630D
Flipping Range
|
0 / 0 |
9 |
|
|
969 |
P1630E
Expected Components
|
0 / 0 |
10 |
|
|
968 |
P1630F
Making It Bipartite
|
0 / 0 |
10 |
|
|
962 |
P1632D
New Year Concert
|
0 / 0 |
7 |
|
|
944 |
P1635D
Infinite Set
|
0 / 0 |
6 |
|
|
903 |
P1644F
Basis
|
0 / 0 |
10 |
|
|
898 |
P1646E
Power Board
|
0 / 0 |
8 |
|
|
893 |
P1647D
Madoka and the Best School in Russia
|
0 / 0 |
6 |
|
|
866 |
P1654D
Potion Brewing Class
|
0 / 0 |
7 |
|
|
859 |
P1656C
Make Equal With Mod
|
0 / 0 |
4 |
|
|
858 |
P1656D
K-good
|
0 / 0 |
6 |
|
|
854 |
P1656H
Equal LCM Subsets
|
0 / 0 |
10 |
|
|
845 |
P1658B
Marin and Anti-coprime Permutation
|
0 / 0 |
3 |
|
|
841 |
P1658E
Gojou and Matrix Game
|
0 / 0 |
9 |
|
|
794 |
P1665D
GCD Guess
|
0 / 0 |
7 |
|
|
740 |
P1673C
Palindrome Basis
|
0 / 0 |
5 |
|
|
739 |
P1673D
Lost Arithmetic Progression
|
0 / 0 |
6 |
|
|
738 |
P1673E
Power or XOR?
|
0 / 0 |
9 |
|
|
704 |
P1679A
AvtoBus
|
0 / 0 |
3 |
|
|
674 |
P1684G
Euclid Guess
|
0 / 0 |
10 |
|
|
660 |
P1687E
Become Big For Me
|
0 / 0 |
10 |
|
|
645 |
P1690F
Shifting String
|
0 / 0 |
5 |
|
|
595 |
P1698G
Long Binary String
|
0 / 0 |
10 |
|
|
590 |
P1699E
Three Days Grace
|
0 / 0 |
10 |
|
|
572 |
P1702F
Equate Multisets
|
0 / 0 |
5 |
|
|
544 |
P1706D1
Chopping Carrots (Easy Version)
|
0 / 0 |
5 |
|
|
543 |
P1706D2
Chopping Carrots (Hard Version)
|
0 / 0 |
9 |
|
|
536 |
P1707F
Bugaboo
|
0 / 0 |
10 |
|
|
519 |
P1712B
Woeful Permutation
|
0 / 0 |
3 |
|
|
516 |
P1712E1
LCM Sum (easy version)
|
0 / 0 |
8 |
|
|
515 |
P1712E2
LCM Sum (hard version)
|
0 / 0 |
9 |
|
|
510 |
P1713D
Tournament Countdown
|
0 / 0 |
6 |
|
|
503 |
P1714E
Add Modulo 10
|
0 / 0 |
4 |
|
|
489 |
P1716F
Bags with Balls
|
0 / 0 |
9 |
|
|
488 |
P1717A
Madoka and Strange Thoughts
|
0 / 0 |
3 |
|
|
484 |
P1717E
Madoka and The Best University
|
0 / 0 |
8 |
|
|
480 |
P1718B
Fibonacci Strings
|
0 / 0 |
7 |
|
|
479 |
P1718C
Tonya and Burenka-179
|
0 / 0 |
9 |
|
|
476 |
P1718F
Burenka, an Array and Queries
|
0 / 0 |
10 |
|
|
472 |
P1720A
Burenka Plays with Fractions
|
0 / 0 |
3 |
|
|
449 |
P1725E
Electrical Efficiency
|
0 / 0 |
9 |
|
|
428 |
P1728E
Red-Black Pepper
|
0 / 0 |
8 |
|
|
414 |
P1730E
Maximums and Minimums
|
0 / 0 |
10 |
|
|
410 |
P1731C
Even Subarrays
|
0 / 0 |
5 |
|
|
408 |
P1731E
Graph Cost
|
0 / 0 |
7 |
|
|
406 |
P1732A
Bestie
|
0 / 0 |
3 |
|
|
402 |
P1732D1
Balance (Easy version)
|
0 / 0 |
5 |
|
|
401 |
P1732D2
Balance (Hard version)
|
0 / 0 |
9 |
|
|
400 |
P1732E
Location
|
0 / 0 |
10 |
|
|
389 |
P1734E
Rectangular Congruence
|
0 / 0 |
7 |
|
|
380 |
P1736B
Playing with GCD
|
0 / 0 |
4 |
|
|
370 |
P1737F
Ela and Prime GCD
|
0 / 0 |
10 |
|
|
354 |
P1740A
Factorise N+M
|
0 / 0 |
3 |
|
|
346 |
P1740I
Arranging Crystal Balls
|
0 / 0 |
10 |
|
|
335 |
P1742D
Coprime
|
0 / 0 |
3 |
|
|
320 |
P1744E1
Divisible Numbers (easy version)
|
0 / 0 |
5 |
|
|
319 |
P1744E2
Divisible Numbers (hard version)
|
0 / 0 |
6 |
|
|
301 |
P1748D
ConstructOR
|
0 / 0 |
7 |
|
|
295 |
P1749D
Counting Arrays
|
0 / 0 |
6 |
|
|
289 |
P1750D
Count GCD
|
0 / 0 |
6 |
|
|
282 |
P1753B
Factorial Divisibility
|
0 / 0 |
5 |
|
|
273 |
P1758C
Almost All Multiples
|
0 / 0 |
4 |
|
|
266 |
P1759D
Make It Round
|
0 / 0 |
4 |
|
|
264 |
P1759F
All Possible Digits
|
0 / 0 |
6 |
|
|
247 |
P1762A
Divide and Conquer
|
0 / 0 |
3 |
|
|
246 |
P1762B
Make Array Good
|
0 / 0 |
3 |
|
|
244 |
P1762D
GCD Queries
|
0 / 0 |
7 |
|
|
237 |
P1763D
Valid Bitonic Permutations
|
0 / 0 |
8 |
|
|
236 |
P1763E
Node Pairs
|
0 / 0 |
8 |
|
|
233 |
P1764B
Doremy's Perfect Math Class
|
0 / 0 |
3 |
|
|
212 |
P1765M
Minimum LCM
|
0 / 0 |
3 |
|
|
207 |
P1766D
Lucky Chains
|
0 / 0 |
5 |
|
|
198 |
P1768A
Greatest Convex
|
0 / 0 |
3 |
|
|
194 |
P1768E
Partial Sorting
|
0 / 0 |
8 |
|
|
190 |
P1770C
Koxia and Number Theory
|
0 / 0 |
5 |
|
|
187 |
P1770F
Koxia and Sequence
|
0 / 0 |
10 |
|
|
182 |
P1771C
Hossam and Trainees
|
0 / 0 |
5 |
