|
|
899 |
codeforces#P1739B Array Recovery
|
0 / 0 |
3 |
|
|
889 |
codeforces#P1740F Conditional Mix
|
0 / 0 |
10 |
|
|
884 |
codeforces#P1741B Funny Permutation
|
0 / 0 |
3 |
|
|
883 |
codeforces#P1741C Minimize the Thickness
|
0 / 0 |
3 |
|
|
880 |
codeforces#P1741F Multi-Colored Segments
|
0 / 0 |
7 |
|
|
874 |
codeforces#P1742E Scuza
|
0 / 0 |
4 |
|
|
872 |
codeforces#P1742G Orray
|
0 / 0 |
5 |
|
|
871 |
codeforces#P1743A Password
|
0 / 0 |
3 |
|
|
865 |
codeforces#P1743G Antifibonacci Cut
|
0 / 0 |
10 |
|
|
863 |
codeforces#P1744B Even-Odd Increments
|
0 / 0 |
3 |
|
|
861 |
codeforces#P1744D Divisibility by 2^n
|
0 / 0 |
4 |
|
|
860 |
codeforces#P1744E1 Divisible Numbers (easy version)
|
0 / 0 |
5 |
|
|
859 |
codeforces#P1744E2 Divisible Numbers (hard version)
|
0 / 0 |
6 |
|
|
858 |
codeforces#P1744F MEX vs MED
|
0 / 0 |
7 |
|
|
855 |
codeforces#P1746C Permutation Operations
|
0 / 0 |
4 |
|
|
845 |
codeforces#P1747E List Generation
|
0 / 0 |
10 |
|
|
844 |
codeforces#P1748A The Ultimate Square
|
0 / 0 |
3 |
|
|
841 |
codeforces#P1748D ConstructOR
|
0 / 0 |
7 |
|
|
840 |
codeforces#P1748E Yet Another Array Counting Problem
|
0 / 0 |
8 |
|
|
835 |
codeforces#P1749D Counting Arrays
|
0 / 0 |
6 |
|
|
832 |
codeforces#P1750A Indirect Sort
|
0 / 0 |
3 |
|
|
829 |
codeforces#P1750D Count GCD
|
0 / 0 |
6 |
|
|
827 |
codeforces#P1750F Majority
|
0 / 0 |
10 |
|
|
826 |
codeforces#P1750G Doping
|
0 / 0 |
10 |
|
|
822 |
codeforces#P1753B Factorial Divisibility
|
0 / 0 |
5 |
|
|
821 |
codeforces#P1753C Wish I Knew How to Sort
|
0 / 0 |
7 |
|
|
816 |
codeforces#P1754B Kevin and Permutation
|
0 / 0 |
3 |
|
|
812 |
codeforces#P1758D Range = √Sum
|
0 / 0 |
6 |
|
|
808 |
codeforces#P1759B Lost Permutation
|
0 / 0 |
3 |
|
|
807 |
codeforces#P1759C Thermostat
|
0 / 0 |
3 |
|
|
804 |
codeforces#P1759F All Possible Digits
|
0 / 0 |
6 |
|
|
803 |
codeforces#P1759G Restore the Permutation
|
0 / 0 |
6 |
|
|
798 |
codeforces#P1760E Binary Inversions
|
0 / 0 |
3 |
|
|
792 |
codeforces#P1761D Carry Bit
|
0 / 0 |
7 |
|
|
790 |
codeforces#P1761F1 Anti-median (Easy Version)
|
0 / 0 |
10 |
|
|
789 |
codeforces#P1761F2 Anti-median (Hard Version)
|
0 / 0 |
10 |
|
|
787 |
codeforces#P1762A Divide and Conquer
|
0 / 0 |
3 |
|
|
785 |
codeforces#P1762C Binary Strings are Fun
|
0 / 0 |
4 |
|
|
783 |
codeforces#P1762E Tree Sum
|
0 / 0 |
10 |
|
|
780 |
codeforces#P1763A Absolute Maximization
|
0 / 0 |
3 |
|
|
779 |
codeforces#P1763B Incinerate
|
0 / 0 |
4 |
|
|
777 |
codeforces#P1763D Valid Bitonic Permutations
|
0 / 0 |
8 |
|
|
776 |
codeforces#P1763E Node Pairs
|
0 / 0 |
8 |
|
|
773 |
codeforces#P1764B Doremy's Perfect Math Class
|
0 / 0 |
3 |
|
|
771 |
codeforces#P1764D Doremy's Pegging Game
|
0 / 0 |
7 |
|
|
760 |
codeforces#P1765E Exchange
|
0 / 0 |
3 |
|
|
755 |
codeforces#P1765J Hero to Zero
|
0 / 0 |
10 |
|
|
754 |
codeforces#P1765K Torus Path
|
0 / 0 |
5 |
|
|
752 |
codeforces#P1765M Minimum LCM
|
0 / 0 |
3 |
|
|
747 |
codeforces#P1766D Lucky Chains
|
0 / 0 |
5 |
|
|
741 |
codeforces#P1767D Playoff
|
0 / 0 |
5 |
|
|
740 |
codeforces#P1767E Algebra Flash
|
0 / 0 |
9 |
|
|
738 |
codeforces#P1768A Greatest Convex
|
0 / 0 |
3 |
|
|
737 |
codeforces#P1768B Quick Sort
|
0 / 0 |
3 |
|
|
734 |
codeforces#P1768E Partial Sorting
|
0 / 0 |
8 |
|
|
730 |
codeforces#P1770C Koxia and Number Theory
|
0 / 0 |
5 |
|
|
728 |
codeforces#P1770E Koxia and Tree
|
0 / 0 |
9 |
|
|
727 |
codeforces#P1770F Koxia and Sequence
|
0 / 0 |
10 |
|
|
726 |
codeforces#P1770G Koxia and Bracket
|
0 / 0 |
10 |
|
|
724 |
codeforces#P1771A Hossam and Combinatorics
|
0 / 0 |
3 |
|
|
722 |
codeforces#P1771C Hossam and Trainees
|
0 / 0 |
5 |
|
|
718 |
codeforces#P1773A Amazing Trick
|
0 / 0 |
6 |
|
|
712 |
codeforces#P1773G Game of Questions
|
0 / 0 |
10 |
|
|
709 |
codeforces#P1773J Jumbled Trees
|
0 / 0 |
10 |
|
|
706 |
codeforces#P1774A Add Plus Minus Sign
|
0 / 0 |
3 |
|
|
705 |
codeforces#P1774B Coloring
|
0 / 0 |
5 |
|
|
694 |
codeforces#P1775C Interesting Sequence
|
0 / 0 |
5 |
|
|
693 |
codeforces#P1775D Friendly Spiders
|
0 / 0 |
6 |
|
|
691 |
codeforces#P1775F Laboratory on Pluto
|
0 / 0 |
9 |
|
|
687 |
codeforces#P1776D Teamwork
|
0 / 0 |
10 |
|
|
684 |
codeforces#P1776G Another Wine Tasting Event
|
0 / 0 |
7 |
|
|
680 |
codeforces#P1776K Uniform Chemistry
|
0 / 0 |
10 |
|
|
679 |
codeforces#P1776L Controllers
|
0 / 0 |
5 |
|
|
677 |
codeforces#P1776N Count Permutations
|
0 / 0 |
10 |
|
|
676 |
codeforces#P1777A Everybody Likes Good Arrays!
|
0 / 0 |
3 |
|
|
675 |
codeforces#P1777B Emordnilap
|
0 / 0 |
3 |
|
|
674 |
codeforces#P1777C Quiz Master
|
0 / 0 |
5 |
|
|
673 |
codeforces#P1777D Score of a Tree
|
0 / 0 |
6 |
|
|
669 |
codeforces#P1778B The Forbidden Permutation
|
0 / 0 |
4 |
|
|
667 |
codeforces#P1778D Flexible String Revisit
|
0 / 0 |
7 |
|
|
666 |
codeforces#P1778E The Tree Has Fallen!
|
0 / 0 |
9 |
|
|
665 |
codeforces#P1778F Maximizing Root
|
0 / 0 |
10 |
|
|
663 |
codeforces#P1779B MKnez's ConstructiveForces Task
|
0 / 0 |
3 |
|
|
655 |
codeforces#P1780B GCD Partition
|
0 / 0 |
3 |
|
|
653 |
codeforces#P1780E Josuke and Complete Graph
|
0 / 0 |
9 |
|
|
651 |
codeforces#P1780G Delicious Dessert
|
0 / 0 |
9 |
|
|
650 |
codeforces#P1781A Parallel Projection
|
0 / 0 |
3 |
|
|
647 |
codeforces#P1781D Many Perfect Squares
|
0 / 0 |
6 |
|
|
645 |
codeforces#P1781F Bracket Insertion
|
0 / 0 |
10 |
|
|
641 |
codeforces#P1783A Make it Beautiful
|
0 / 0 |
3 |
|
|
640 |
codeforces#P1783B Matrix of Differences
|
0 / 0 |
3 |
|
|
637 |
codeforces#P1783E Game of the Year
|
0 / 0 |
8 |
|
|
625 |
codeforces#P1787A Exponential Equation
|
0 / 0 |
3 |
|
|
624 |
codeforces#P1787B Number Factorization
|
0 / 0 |
3 |
|
|
623 |
codeforces#P1787C Remove the Bracket
|
0 / 0 |
5 |
|
|
621 |
codeforces#P1787E The Harmonization of XOR
|
0 / 0 |
7 |
|
|
620 |
codeforces#P1787F Inverse Transformation
|
0 / 0 |
9 |
|
|
616 |
codeforces#P1788A One and Two
|
0 / 0 |
3 |
|
|
615 |
codeforces#P1788B Sum of Two Numbers
|
0 / 0 |
3 |
|
|
614 |
codeforces#P1788C Matching Numbers
|
0 / 0 |
4 |
