|
|
856 |
codeforces#P1746B Rebellion
|
0 / 0 |
3 |
|
|
855 |
codeforces#P1746C Permutation Operations
|
0 / 0 |
4 |
|
|
854 |
codeforces#P1746D Paths on the Tree
|
0 / 0 |
6 |
|
|
853 |
codeforces#P1746E1 Joking (Easy Version)
|
0 / 0 |
9 |
|
|
852 |
codeforces#P1746E2 Joking (Hard Version)
|
0 / 0 |
10 |
|
|
851 |
codeforces#P1746F Kazaee
|
0 / 0 |
10 |
|
|
850 |
codeforces#P1746G Olympiad Training
|
0 / 0 |
10 |
|
|
849 |
codeforces#P1747A Two Groups
|
0 / 0 |
3 |
|
|
848 |
codeforces#P1747B BAN BAN
|
0 / 0 |
3 |
|
|
847 |
codeforces#P1747C Swap Game
|
0 / 0 |
4 |
|
|
846 |
codeforces#P1747D Yet Another Problem
|
0 / 0 |
6 |
|
|
845 |
codeforces#P1747E List Generation
|
0 / 0 |
10 |
|
|
844 |
codeforces#P1748A The Ultimate Square
|
0 / 0 |
3 |
|
|
843 |
codeforces#P1748B Diverse Substrings
|
0 / 0 |
4 |
|
|
842 |
codeforces#P1748C Zero-Sum Prefixes
|
0 / 0 |
5 |
|
|
841 |
codeforces#P1748D ConstructOR
|
0 / 0 |
7 |
|
|
840 |
codeforces#P1748E Yet Another Array Counting Problem
|
0 / 0 |
8 |
|
|
839 |
codeforces#P1748F Circular Xor Reversal
|
0 / 0 |
10 |
|
|
838 |
codeforces#P1749A Cowardly Rooks
|
0 / 0 |
3 |
|
|
837 |
codeforces#P1749B Death's Blessing
|
0 / 0 |
3 |
|
|
836 |
codeforces#P1749C Number Game
|
0 / 0 |
4 |
|
|
835 |
codeforces#P1749D Counting Arrays
|
0 / 0 |
6 |
|
|
834 |
codeforces#P1749E Cactus Wall
|
0 / 0 |
9 |
|
|
833 |
codeforces#P1749F Distance to the Path
|
0 / 0 |
10 |
|
|
832 |
codeforces#P1750A Indirect Sort
|
0 / 0 |
3 |
|
|
831 |
codeforces#P1750B Maximum Substring
|
0 / 0 |
3 |
|
|
830 |
codeforces#P1750C Complementary XOR
|
0 / 0 |
4 |
|
|
829 |
codeforces#P1750D Count GCD
|
0 / 0 |
6 |
|
|
828 |
codeforces#P1750E Bracket Cost
|
0 / 0 |
9 |
|
|
827 |
codeforces#P1750F Majority
|
0 / 0 |
10 |
|
|
826 |
codeforces#P1750G Doping
|
0 / 0 |
10 |
|
|
825 |
codeforces#P1750H BinaryStringForces
|
0 / 0 |
10 |
|
|
824 |
codeforces#P1753A1 Make Nonzero Sum (easy version)
|
0 / 0 |
4 |
|
|
823 |
codeforces#P1753A2 Make Nonzero Sum (hard version)
|
0 / 0 |
5 |
|
|
822 |
codeforces#P1753B Factorial Divisibility
|
0 / 0 |
5 |
|
|
821 |
codeforces#P1753C Wish I Knew How to Sort
|
0 / 0 |
7 |
|
|
820 |
codeforces#P1753D The Beach
|
0 / 0 |
9 |
|
|
819 |
codeforces#P1753E N Machines
|
0 / 0 |
10 |
|
|
818 |
codeforces#P1753F Minecraft Series
|
0 / 0 |
10 |
|
|
817 |
codeforces#P1754A Technical Support
|
0 / 0 |
3 |
|
|
816 |
codeforces#P1754B Kevin and Permutation
|
0 / 0 |
3 |
|
|
815 |
codeforces#P1758A SSeeeeiinngg DDoouubbllee
|
0 / 0 |
3 |
|
|
814 |
codeforces#P1758B XOR = Average
|
0 / 0 |
3 |
|
|
813 |
codeforces#P1758C Almost All Multiples
|
0 / 0 |
4 |
|
|
812 |
codeforces#P1758D Range = √Sum
|
0 / 0 |
6 |
|
|
811 |
codeforces#P1758E Tick, Tock
|
0 / 0 |
9 |
|
|
810 |
codeforces#P1758F Decent Division
|
0 / 0 |
10 |
|
|
809 |
codeforces#P1759A Yes-Yes?
|
0 / 0 |
3 |
|
|
808 |
codeforces#P1759B Lost Permutation
|
0 / 0 |
3 |
|
|
807 |
codeforces#P1759C Thermostat
|
0 / 0 |
3 |
|
|
806 |
codeforces#P1759D Make It Round
|
0 / 0 |
4 |
|
|
805 |
codeforces#P1759E The Humanoid
|
0 / 0 |
5 |
|
|
804 |
codeforces#P1759F All Possible Digits
|
0 / 0 |
6 |
|
|
803 |
codeforces#P1759G Restore the Permutation
|
0 / 0 |
6 |
|
|
802 |
codeforces#P1760A Medium Number
|
0 / 0 |
3 |
|
|
801 |
codeforces#P1760B Atilla's Favorite Problem
|
0 / 0 |
3 |
|
|
800 |
codeforces#P1760C Advantage
|
0 / 0 |
3 |
|
|
799 |
codeforces#P1760D Challenging Valleys
|
0 / 0 |
3 |
|
|
798 |
codeforces#P1760E Binary Inversions
|
0 / 0 |
3 |
|
|
797 |
codeforces#P1760F Quests
|
0 / 0 |
5 |
|
|
796 |
codeforces#P1760G SlavicG's Favorite Problem
|
0 / 0 |
5 |
|
|
795 |
codeforces#P1761A Two Permutations
|
0 / 0 |
3 |
|
|
794 |
codeforces#P1761B Elimination of a Ring
|
0 / 0 |
3 |
|
|
793 |
codeforces#P1761C Set Construction
|
0 / 0 |
4 |
|
|
792 |
codeforces#P1761D Carry Bit
|
0 / 0 |
7 |
|
|
791 |
codeforces#P1761E Make It Connected
|
0 / 0 |
9 |
|
|
790 |
codeforces#P1761F1 Anti-median (Easy Version)
|
0 / 0 |
10 |
|
|
789 |
codeforces#P1761F2 Anti-median (Hard Version)
|
0 / 0 |
10 |
|
|
788 |
codeforces#P1761G Centroid Guess
|
0 / 0 |
10 |
|
|
787 |
codeforces#P1762A Divide and Conquer
|
0 / 0 |
3 |
|
|
786 |
codeforces#P1762B Make Array Good
|
0 / 0 |
3 |
|
|
785 |
codeforces#P1762C Binary Strings are Fun
|
0 / 0 |
4 |
|
|
784 |
codeforces#P1762D GCD Queries
|
0 / 0 |
7 |
|
|
783 |
codeforces#P1762E Tree Sum
|
0 / 0 |
10 |
|
|
782 |
codeforces#P1762F Good Pairs
|
0 / 0 |
10 |
|
|
781 |
codeforces#P1762G Unequal Adjacent Elements
|
0 / 0 |
10 |
|
|
780 |
codeforces#P1763A Absolute Maximization
|
0 / 0 |
3 |
|
|
779 |
codeforces#P1763B Incinerate
|
0 / 0 |
4 |
|
|
778 |
codeforces#P1763C Another Array Problem
|
0 / 0 |
7 |
|
|
777 |
codeforces#P1763D Valid Bitonic Permutations
|
0 / 0 |
8 |
|
|
776 |
codeforces#P1763E Node Pairs
|
0 / 0 |
8 |
|
|
775 |
codeforces#P1763F Edge Queries
|
0 / 0 |
10 |
|
|
774 |
codeforces#P1764A Doremy's Paint
|
0 / 0 |
3 |
|
|
773 |
codeforces#P1764B Doremy's Perfect Math Class
|
0 / 0 |
3 |
|
|
772 |
codeforces#P1764C Doremy's City Construction
|
0 / 0 |
4 |
|
|
771 |
codeforces#P1764D Doremy's Pegging Game
|
0 / 0 |
7 |
|
|
770 |
codeforces#P1764E Doremy's Number Line
|
0 / 0 |
9 |
|
|
769 |
codeforces#P1764F Doremy's Experimental Tree
|
0 / 0 |
9 |
|
|
768 |
codeforces#P1764G1 Doremy's Perfect DS Class (Easy Version)
|
0 / 0 |
10 |
|
|
767 |
codeforces#P1764G2 Doremy's Perfect DS Class (Medium Version)
|
0 / 0 |
10 |
|
|
766 |
codeforces#P1764G3 Doremy's Perfect DS Class (Hard Version)
|
0 / 0 |
10 |
|
|
765 |
codeforces#P1764H Doremy's Paint 2
|
0 / 0 |
10 |
|
|
764 |
codeforces#P1765A Access Levels
|
0 / 0 |
9 |
|
|
763 |
codeforces#P1765B Broken Keyboard
|
0 / 0 |
3 |
|
|
762 |
codeforces#P1765C Card Guessing
|
0 / 0 |
10 |
|
|
761 |
codeforces#P1765D Watch the Videos
|
0 / 0 |
5 |
|
|
760 |
codeforces#P1765E Exchange
|
0 / 0 |
3 |
|
|
759 |
codeforces#P1765F Chemistry Lab
|
0 / 0 |
8 |
|
|
758 |
codeforces#P1765G Guess the String
|
0 / 0 |
10 |
|
|
757 |
codeforces#P1765H Hospital Queue
|
0 / 0 |
8 |
