|
|
2149 |
P1593D2
Half of Same
|
0 / 0 |
6 |
|
|
2118 |
P1601A
Array Elimination
|
0 / 0 |
4 |
|
|
2110 |
P1603A
Di-visible Confusion
|
0 / 0 |
4 |
|
|
2109 |
P1603B
Moderate Modular Mode
|
0 / 0 |
5 |
|
|
2108 |
P1603C
Extreme Extension
|
0 / 0 |
8 |
|
|
2107 |
P1603D
Artistic Partition
|
0 / 0 |
10 |
|
|
2102 |
P1605A
A.M
|
0 / 0 |
3 |
|
|
2098 |
P1605E
Array Equalizer
|
0 / 0 |
9 |
|
|
2094 |
P1606C
Banknotes
|
0 / 0 |
4 |
|
|
2079 |
P1608D
Dominoes
|
0 / 0 |
9 |
|
|
2075 |
P1609A
Divide and Multiply
|
0 / 0 |
3 |
|
|
2073 |
P1609C
Complex Market Analysis
|
0 / 0 |
4 |
|
|
2064 |
P1610D
Not Quite Lee
|
0 / 0 |
7 |
|
|
2047 |
P1612D
X-Magic Pair
|
0 / 0 |
5 |
|
|
2034 |
P1614D1
Divan and Kostomuksha (easy version)
|
0 / 0 |
7 |
|
|
2033 |
P1614D2
Divan and Kostomuksha (hard version)
|
0 / 0 |
8 |
|
|
2014 |
P1617B
GCD Problem
|
0 / 0 |
3 |
|
|
2010 |
P1617E
Christmas Chocolates
|
0 / 0 |
10 |
|
|
1973 |
P1622F
Quadratic Set
|
0 / 0 |
10 |
|
|
1949 |
P1626F
A Random Code Problem
|
0 / 0 |
10 |
|
|
1946 |
P1627C
Not Assigning
|
0 / 0 |
4 |
|
|
1945 |
P1627D
Not Adding
|
0 / 0 |
6 |
|
|
1934 |
P1629B
GCD Arrays
|
0 / 0 |
3 |
|
|
1930 |
P1630D
Flipping Range
|
0 / 0 |
9 |
|
|
1929 |
P1630E
Expected Components
|
0 / 0 |
10 |
|
|
1928 |
P1630F
Making It Bipartite
|
0 / 0 |
10 |
|
|
1922 |
P1632D
New Year Concert
|
0 / 0 |
7 |
|
|
1900 |
P1635D
Infinite Set
|
0 / 0 |
6 |
|
|
1854 |
P1644F
Basis
|
0 / 0 |
10 |
|
|
1849 |
P1646E
Power Board
|
0 / 0 |
8 |
|
|
1844 |
P1647D
Madoka and the Best School in Russia
|
0 / 0 |
6 |
|
|
1817 |
P1654D
Potion Brewing Class
|
0 / 0 |
7 |
|
|
1810 |
P1656C
Make Equal With Mod
|
0 / 0 |
4 |
|
|
1809 |
P1656D
K-good
|
0 / 0 |
6 |
|
|
1805 |
P1656H
Equal LCM Subsets
|
0 / 0 |
10 |
|
|
1796 |
P1658B
Marin and Anti-coprime Permutation
|
0 / 0 |
3 |
|
|
1792 |
P1658E
Gojou and Matrix Game
|
0 / 0 |
9 |
|
|
1745 |
P1665D
GCD Guess
|
0 / 0 |
7 |
|
|
1691 |
P1673C
Palindrome Basis
|
0 / 0 |
5 |
|
|
1690 |
P1673D
Lost Arithmetic Progression
|
0 / 0 |
6 |
|
|
1689 |
P1673E
Power or XOR?
|
0 / 0 |
9 |
|
|
1655 |
P1679A
AvtoBus
|
0 / 0 |
3 |
|
|
1625 |
P1684G
Euclid Guess
|
0 / 0 |
10 |
|
|
1611 |
P1687E
Become Big For Me
|
0 / 0 |
10 |
|
|
1596 |
P1690F
Shifting String
|
0 / 0 |
5 |
|
|
1546 |
P1698G
Long Binary String
|
0 / 0 |
10 |
|
|
1541 |
P1699E
Three Days Grace
|
0 / 0 |
10 |
|
|
1523 |
P1702F
Equate Multisets
|
0 / 0 |
5 |
|
|
1495 |
P1706D1
Chopping Carrots (Easy Version)
|
0 / 0 |
5 |
|
|
1494 |
P1706D2
Chopping Carrots (Hard Version)
|
0 / 0 |
9 |
|
|
1487 |
P1707F
Bugaboo
|
0 / 0 |
10 |
|
|
1470 |
P1712B
Woeful Permutation
|
0 / 0 |
3 |
|
|
1467 |
P1712E1
LCM Sum (easy version)
|
0 / 0 |
8 |
|
|
1466 |
P1712E2
LCM Sum (hard version)
|
0 / 0 |
9 |
|
|
1461 |
P1713D
Tournament Countdown
|
0 / 0 |
6 |
|
|
1454 |
P1714E
Add Modulo 10
|
0 / 0 |
4 |
|
|
1440 |
P1716F
Bags with Balls
|
0 / 0 |
9 |
|
|
1439 |
P1717A
Madoka and Strange Thoughts
|
0 / 0 |
3 |
|
|
1435 |
P1717E
Madoka and The Best University
|
0 / 0 |
8 |
|
|
1431 |
P1718B
Fibonacci Strings
|
0 / 0 |
7 |
|
|
1430 |
P1718C
Tonya and Burenka-179
|
0 / 0 |
9 |
|
|
1427 |
P1718F
Burenka, an Array and Queries
|
0 / 0 |
10 |
|
|
1423 |
P1720A
Burenka Plays with Fractions
|
0 / 0 |
3 |
|
|
1400 |
P1725E
Electrical Efficiency
|
0 / 0 |
9 |
|
|
1379 |
P1728E
Red-Black Pepper
|
0 / 0 |
8 |
|
|
1365 |
P1730E
Maximums and Minimums
|
0 / 0 |
10 |
|
|
1361 |
P1731C
Even Subarrays
|
0 / 0 |
5 |
|
|
1359 |
P1731E
Graph Cost
|
0 / 0 |
7 |
|
|
1357 |
P1732A
Bestie
|
0 / 0 |
3 |
|
|
1353 |
P1732D1
Balance (Easy version)
|
0 / 0 |
5 |
|
|
1352 |
P1732D2
Balance (Hard version)
|
0 / 0 |
9 |
|
|
1351 |
P1732E
Location
|
0 / 0 |
10 |
|
|
1340 |
P1734E
Rectangular Congruence
|
0 / 0 |
7 |
|
|
1331 |
P1736B
Playing with GCD
|
0 / 0 |
4 |
|
|
1321 |
P1737F
Ela and Prime GCD
|
0 / 0 |
10 |
|
|
1305 |
P1740A
Factorise N+M
|
0 / 0 |
3 |
|
|
1297 |
P1740I
Arranging Crystal Balls
|
0 / 0 |
10 |
|
|
1286 |
P1742D
Coprime
|
0 / 0 |
3 |
|
|
1271 |
P1744E1
Divisible Numbers (easy version)
|
0 / 0 |
5 |
|
|
1270 |
P1744E2
Divisible Numbers (hard version)
|
0 / 0 |
6 |
|
|
1252 |
P1748D
ConstructOR
|
0 / 0 |
7 |
|
|
1246 |
P1749D
Counting Arrays
|
0 / 0 |
6 |
|
|
1240 |
P1750D
Count GCD
|
0 / 0 |
6 |
|
|
1233 |
P1753B
Factorial Divisibility
|
0 / 0 |
5 |
|
|
1224 |
P1758C
Almost All Multiples
|
0 / 0 |
4 |
|
|
1217 |
P1759D
Make It Round
|
0 / 0 |
4 |
|
|
1215 |
P1759F
All Possible Digits
|
0 / 0 |
6 |
|
|
1198 |
P1762A
Divide and Conquer
|
0 / 0 |
3 |
|
|
1197 |
P1762B
Make Array Good
|
0 / 0 |
3 |
|
|
1195 |
P1762D
GCD Queries
|
0 / 0 |
7 |
|
|
1188 |
P1763D
Valid Bitonic Permutations
|
0 / 0 |
8 |
|
|
1187 |
P1763E
Node Pairs
|
0 / 0 |
8 |
|
|
1184 |
P1764B
Doremy's Perfect Math Class
|
0 / 0 |
3 |
|
|
1163 |
P1765M
Minimum LCM
|
0 / 0 |
3 |
|
|
1158 |
P1766D
Lucky Chains
|
0 / 0 |
5 |
|
|
1149 |
P1768A
Greatest Convex
|
0 / 0 |
3 |
|
|
1145 |
P1768E
Partial Sorting
|
0 / 0 |
8 |
|
|
1141 |
P1770C
Koxia and Number Theory
|
0 / 0 |
5 |
|
|
1138 |
P1770F
Koxia and Sequence
|
0 / 0 |
10 |
|
|
1133 |
P1771C
Hossam and Trainees
|
0 / 0 |
5 |
