|
1692 |
P1593D2 Half of Same
|
0 / 0 |
6 |
|
1644 |
P1601A Array Elimination
|
0 / 0 |
4 |
|
1632 |
P1603A Di-visible Confusion
|
0 / 0 |
4 |
|
1631 |
P1603B Moderate Modular Mode
|
1 / 1 |
5 |
|
1630 |
P1603C Extreme Extension
|
0 / 0 |
8 |
|
1629 |
P1603D Artistic Partition
|
0 / 0 |
10 |
|
1623 |
P1605A A.M
|
0 / 0 |
3 |
|
1619 |
P1605E Array Equalizer
|
0 / 0 |
9 |
|
1614 |
P1606C Banknotes
|
0 / 0 |
4 |
|
1590 |
P1608D Dominoes
|
0 / 0 |
9 |
|
1583 |
P1609A Divide and Multiply
|
0 / 0 |
3 |
|
1578 |
P1609C Complex Market Analysis
|
0 / 0 |
4 |
|
1568 |
P1610D Not Quite Lee
|
0 / 0 |
7 |
|
1551 |
P1612D X-Magic Pair
|
0 / 0 |
5 |
|
1538 |
P1614D1 Divan and Kostomuksha (easy version)
|
0 / 0 |
7 |
|
1537 |
P1614D2 Divan and Kostomuksha (hard version)
|
0 / 0 |
8 |
|
1518 |
P1617B GCD Problem
|
0 / 0 |
3 |
|
1514 |
P1617E Christmas Chocolates
|
0 / 0 |
10 |
|
1477 |
P1622F Quadratic Set
|
0 / 0 |
10 |
|
1453 |
P1626F A Random Code Problem
|
0 / 0 |
10 |
|
1449 |
P1627C Not Assigning
|
0 / 0 |
4 |
|
1447 |
P1627D Not Adding
|
0 / 0 |
6 |
|
1425 |
P1629B GCD Arrays
|
0 / 0 |
3 |
|
1417 |
P1630D Flipping Range
|
0 / 0 |
9 |
|
1416 |
P1630E Expected Components
|
0 / 0 |
10 |
|
1414 |
P1630F Making It Bipartite
|
0 / 0 |
10 |
|
1404 |
P1632D New Year Concert
|
0 / 0 |
7 |
|
1386 |
P1635D Infinite Set
|
0 / 0 |
6 |
|
1345 |
P1644F Basis
|
0 / 0 |
10 |
|
1340 |
P1646E Power Board
|
0 / 0 |
8 |
|
1335 |
P1647D Madoka and the Best School in Russia
|
0 / 0 |
6 |
|
1308 |
P1654D Potion Brewing Class
|
0 / 0 |
7 |
|
1301 |
P1656C Make Equal With Mod
|
0 / 0 |
4 |
|
1300 |
P1656D K-good
|
0 / 0 |
6 |
|
1296 |
P1656H Equal LCM Subsets
|
0 / 0 |
10 |
|
1287 |
P1658B Marin and Anti-coprime Permutation
|
0 / 0 |
3 |
|
1283 |
P1658E Gojou and Matrix Game
|
0 / 0 |
9 |
|
1236 |
P1665D GCD Guess
|
0 / 0 |
7 |
|
1182 |
P1673C Palindrome Basis
|
0 / 0 |
5 |
|
1181 |
P1673D Lost Arithmetic Progression
|
0 / 0 |
6 |
|
1180 |
P1673E Power or XOR?
|
0 / 0 |
9 |
|
1146 |
P1679A AvtoBus
|
0 / 0 |
3 |
|
1116 |
P1684G Euclid Guess
|
0 / 0 |
10 |
|
1088 |
P1687E Become Big For Me
|
0 / 0 |
10 |
|
1063 |
P1690F Shifting String
|
0 / 0 |
5 |
|
990 |
P1698G Long Binary String
|
0 / 0 |
10 |
|
982 |
P1699E Three Days Grace
|
0 / 0 |
10 |
|
964 |
P1702F Equate Multisets
|
0 / 0 |
5 |
|
936 |
P1706D1 Chopping Carrots (Easy Version)
|
0 / 0 |
5 |
|
935 |
P1706D2 Chopping Carrots (Hard Version)
|
0 / 0 |
9 |
|
928 |
P1707F Bugaboo
|
0 / 0 |
10 |
|
911 |
P1712B Woeful Permutation
|
0 / 0 |
3 |
|
908 |
P1712E1 LCM Sum (easy version)
|
0 / 0 |
8 |
|
907 |
P1712E2 LCM Sum (hard version)
|
0 / 0 |
9 |
|
902 |
P1713D Tournament Countdown
|
0 / 0 |
6 |
|
895 |
P1714E Add Modulo 10
|
0 / 0 |
4 |
|
881 |
P1716F Bags with Balls
|
0 / 0 |
9 |
|
880 |
P1717A Madoka and Strange Thoughts
|
0 / 0 |
3 |
|
876 |
P1717E Madoka and The Best University
|
0 / 0 |
8 |
|
872 |
P1718B Fibonacci Strings
|
0 / 0 |
7 |
|
871 |
P1718C Tonya and Burenka-179
|
0 / 0 |
9 |
|
868 |
P1718F Burenka, an Array and Queries
|
0 / 0 |
10 |
|
864 |
P1720A Burenka Plays with Fractions
|
0 / 0 |
3 |
|
841 |
P1725E Electrical Efficiency
|
0 / 0 |
9 |
|
820 |
P1728E Red-Black Pepper
|
0 / 0 |
8 |
|
806 |
P1730E Maximums and Minimums
|
0 / 0 |
10 |
|
802 |
P1731C Even Subarrays
|
0 / 0 |
5 |
|
800 |
P1731E Graph Cost
|
0 / 0 |
7 |
|
798 |
P1732A Bestie
|
0 / 0 |
3 |
|
794 |
P1732D1 Balance (Easy version)
|
0 / 0 |
5 |
|
793 |
P1732D2 Balance (Hard version)
|
0 / 0 |
9 |
|
792 |
P1732E Location
|
0 / 0 |
10 |
|
781 |
P1734E Rectangular Congruence
|
0 / 0 |
7 |
|
772 |
P1736B Playing with GCD
|
0 / 0 |
4 |
|
760 |
P1737F Ela and Prime GCD
|
0 / 0 |
10 |
|
739 |
P1740A Factorise N+M
|
0 / 0 |
3 |
|
729 |
P1740I Arranging Crystal Balls
|
0 / 0 |
10 |
|
711 |
P1742D Coprime
|
0 / 0 |
3 |
|
682 |
P1744E1 Divisible Numbers (easy version)
|
0 / 0 |
5 |
|
679 |
P1744E2 Divisible Numbers (hard version)
|
0 / 0 |
6 |
|
651 |
P1748D ConstructOR
|
0 / 0 |
7 |
|
641 |
P1749D Counting Arrays
|
0 / 0 |
6 |
|
629 |
P1750D Count GCD
|
0 / 0 |
6 |
|
616 |
P1753B Factorial Divisibility
|
1 / 1 |
5 |
|
598 |
P1758C Almost All Multiples
|
0 / 0 |
4 |
|
584 |
P1759D Make It Round
|
0 / 0 |
4 |
|
581 |
P1759F All Possible Digits
|
0 / 0 |
6 |
|
555 |
P1762A Divide and Conquer
|
0 / 0 |
3 |
|
554 |
P1762B Make Array Good
|
0 / 0 |
3 |
|
552 |
P1762D GCD Queries
|
0 / 11 |
7 |
|
539 |
P1763D Valid Bitonic Permutations
|
0 / 0 |
8 |
|
538 |
P1763E Node Pairs
|
0 / 0 |
8 |
|
532 |
P1764B Doremy's Perfect Math Class
|
0 / 0 |
3 |
|
493 |
P1765M Minimum LCM
|
1 / 1 |
3 |
|
484 |
P1766D Lucky Chains
|
0 / 0 |
5 |
|
473 |
P1768A Greatest Convex
|
0 / 0 |
3 |
|
468 |
P1768E Partial Sorting
|
0 / 0 |
8 |
|
459 |
P1770C Koxia and Number Theory
|
1 / 1 |
5 |
|
453 |
P1770F Koxia and Sequence
|
0 / 0 |
10 |
|
444 |
P1771C Hossam and Trainees
|
0 / 0 |
5 |