|
|
1682 |
P1593D2
Half of Same
|
0 / 0 |
6 |
|
|
1651 |
P1601A
Array Elimination
|
0 / 0 |
4 |
|
|
1643 |
P1603A
Di-visible Confusion
|
0 / 0 |
4 |
|
|
1642 |
P1603B
Moderate Modular Mode
|
0 / 0 |
5 |
|
|
1641 |
P1603C
Extreme Extension
|
0 / 0 |
8 |
|
|
1640 |
P1603D
Artistic Partition
|
0 / 0 |
10 |
|
|
1635 |
P1605A
A.M
|
0 / 0 |
3 |
|
|
1631 |
P1605E
Array Equalizer
|
0 / 0 |
9 |
|
|
1627 |
P1606C
Banknotes
|
0 / 0 |
4 |
|
|
1612 |
P1608D
Dominoes
|
0 / 0 |
9 |
|
|
1608 |
P1609A
Divide and Multiply
|
0 / 0 |
3 |
|
|
1606 |
P1609C
Complex Market Analysis
|
0 / 0 |
4 |
|
|
1597 |
P1610D
Not Quite Lee
|
0 / 0 |
7 |
|
|
1580 |
P1612D
X-Magic Pair
|
0 / 0 |
5 |
|
|
1567 |
P1614D1
Divan and Kostomuksha (easy version)
|
0 / 0 |
7 |
|
|
1566 |
P1614D2
Divan and Kostomuksha (hard version)
|
0 / 0 |
8 |
|
|
1547 |
P1617B
GCD Problem
|
0 / 0 |
3 |
|
|
1543 |
P1617E
Christmas Chocolates
|
0 / 0 |
10 |
|
|
1506 |
P1622F
Quadratic Set
|
0 / 0 |
10 |
|
|
1482 |
P1626F
A Random Code Problem
|
0 / 0 |
10 |
|
|
1479 |
P1627C
Not Assigning
|
0 / 0 |
4 |
|
|
1478 |
P1627D
Not Adding
|
0 / 0 |
6 |
|
|
1467 |
P1629B
GCD Arrays
|
0 / 0 |
3 |
|
|
1463 |
P1630D
Flipping Range
|
0 / 0 |
9 |
|
|
1462 |
P1630E
Expected Components
|
0 / 0 |
10 |
|
|
1461 |
P1630F
Making It Bipartite
|
0 / 0 |
10 |
|
|
1455 |
P1632D
New Year Concert
|
0 / 0 |
7 |
|
|
1437 |
P1635D
Infinite Set
|
0 / 0 |
6 |
|
|
1396 |
P1644F
Basis
|
0 / 0 |
10 |
|
|
1391 |
P1646E
Power Board
|
0 / 0 |
8 |
|
|
1386 |
P1647D
Madoka and the Best School in Russia
|
0 / 0 |
6 |
|
|
1359 |
P1654D
Potion Brewing Class
|
0 / 0 |
7 |
|
|
1352 |
P1656C
Make Equal With Mod
|
0 / 0 |
4 |
|
|
1351 |
P1656D
K-good
|
0 / 0 |
6 |
|
|
1347 |
P1656H
Equal LCM Subsets
|
0 / 0 |
10 |
|
|
1338 |
P1658B
Marin and Anti-coprime Permutation
|
0 / 0 |
3 |
|
|
1334 |
P1658E
Gojou and Matrix Game
|
0 / 0 |
9 |
|
|
1287 |
P1665D
GCD Guess
|
0 / 0 |
7 |
|
|
1233 |
P1673C
Palindrome Basis
|
0 / 0 |
5 |
|
|
1232 |
P1673D
Lost Arithmetic Progression
|
0 / 0 |
6 |
|
|
1231 |
P1673E
Power or XOR?
|
0 / 0 |
9 |
|
|
1197 |
P1679A
AvtoBus
|
0 / 0 |
3 |
|
|
1167 |
P1684G
Euclid Guess
|
0 / 0 |
10 |
|
|
1153 |
P1687E
Become Big For Me
|
0 / 0 |
10 |
|
|
1138 |
P1690F
Shifting String
|
0 / 0 |
5 |
|
|
1088 |
P1698G
Long Binary String
|
0 / 0 |
10 |
|
|
1083 |
P1699E
Three Days Grace
|
0 / 0 |
10 |
|
|
1065 |
P1702F
Equate Multisets
|
0 / 0 |
5 |
|
|
1037 |
P1706D1
Chopping Carrots (Easy Version)
|
0 / 0 |
5 |
|
|
1036 |
P1706D2
Chopping Carrots (Hard Version)
|
0 / 0 |
9 |
|
|
1029 |
P1707F
Bugaboo
|
0 / 0 |
10 |
|
|
1012 |
P1712B
Woeful Permutation
|
0 / 0 |
3 |
|
|
1009 |
P1712E1
LCM Sum (easy version)
|
0 / 0 |
8 |
|
|
1008 |
P1712E2
LCM Sum (hard version)
|
0 / 0 |
9 |
|
|
1003 |
P1713D
Tournament Countdown
|
0 / 0 |
6 |
|
|
996 |
P1714E
Add Modulo 10
|
0 / 0 |
4 |
|
|
982 |
P1716F
Bags with Balls
|
0 / 0 |
9 |
|
|
981 |
P1717A
Madoka and Strange Thoughts
|
0 / 0 |
3 |
|
|
977 |
P1717E
Madoka and The Best University
|
0 / 0 |
8 |
|
|
973 |
P1718B
Fibonacci Strings
|
0 / 0 |
7 |
|
|
972 |
P1718C
Tonya and Burenka-179
|
0 / 0 |
9 |
|
|
969 |
P1718F
Burenka, an Array and Queries
|
0 / 0 |
10 |
|
|
965 |
P1720A
Burenka Plays with Fractions
|
0 / 0 |
3 |
|
|
942 |
P1725E
Electrical Efficiency
|
0 / 0 |
9 |
|
|
921 |
P1728E
Red-Black Pepper
|
0 / 0 |
8 |
|
|
907 |
P1730E
Maximums and Minimums
|
0 / 0 |
10 |
|
|
903 |
P1731C
Even Subarrays
|
0 / 0 |
5 |
|
|
901 |
P1731E
Graph Cost
|
0 / 0 |
7 |
|
|
899 |
P1732A
Bestie
|
0 / 0 |
3 |
|
|
895 |
P1732D1
Balance (Easy version)
|
0 / 0 |
5 |
|
|
894 |
P1732D2
Balance (Hard version)
|
0 / 0 |
9 |
|
|
893 |
P1732E
Location
|
0 / 0 |
10 |
|
|
882 |
P1734E
Rectangular Congruence
|
0 / 0 |
7 |
|
|
873 |
P1736B
Playing with GCD
|
0 / 0 |
4 |
|
|
863 |
P1737F
Ela and Prime GCD
|
0 / 0 |
10 |
|
|
847 |
P1740A
Factorise N+M
|
0 / 0 |
3 |
|
|
839 |
P1740I
Arranging Crystal Balls
|
0 / 0 |
10 |
|
|
828 |
P1742D
Coprime
|
0 / 0 |
3 |
|
|
813 |
P1744E1
Divisible Numbers (easy version)
|
0 / 0 |
5 |
|
|
812 |
P1744E2
Divisible Numbers (hard version)
|
0 / 0 |
6 |
|
|
794 |
P1748D
ConstructOR
|
0 / 0 |
7 |
|
|
788 |
P1749D
Counting Arrays
|
0 / 0 |
6 |
|
|
782 |
P1750D
Count GCD
|
0 / 0 |
6 |
|
|
775 |
P1753B
Factorial Divisibility
|
0 / 0 |
5 |
|
|
766 |
P1758C
Almost All Multiples
|
0 / 0 |
4 |
|
|
759 |
P1759D
Make It Round
|
0 / 0 |
4 |
|
|
757 |
P1759F
All Possible Digits
|
0 / 0 |
6 |
|
|
740 |
P1762A
Divide and Conquer
|
0 / 0 |
3 |
|
|
739 |
P1762B
Make Array Good
|
0 / 0 |
3 |
|
|
737 |
P1762D
GCD Queries
|
0 / 0 |
7 |
|
|
730 |
P1763D
Valid Bitonic Permutations
|
0 / 0 |
8 |
|
|
729 |
P1763E
Node Pairs
|
0 / 0 |
8 |
|
|
726 |
P1764B
Doremy's Perfect Math Class
|
0 / 0 |
3 |
|
|
705 |
P1765M
Minimum LCM
|
0 / 0 |
3 |
|
|
700 |
P1766D
Lucky Chains
|
0 / 0 |
5 |
|
|
691 |
P1768A
Greatest Convex
|
0 / 0 |
3 |
|
|
687 |
P1768E
Partial Sorting
|
0 / 0 |
8 |
|
|
683 |
P1770C
Koxia and Number Theory
|
0 / 0 |
5 |
|
|
680 |
P1770F
Koxia and Sequence
|
0 / 0 |
10 |
|
|
675 |
P1771C
Hossam and Trainees
|
0 / 0 |
5 |
