ID 题目 显示标签 隐藏标签 AC / 尝试 难度
904 P1807E   Interview 0 / 0 4
903 P1807F   Bouncy Ball 0 / 0 5
902 P1807G1   Subsequence Addition (Easy Version) 0 / 0 3
901 P1807G2   Subsequence Addition (Hard Version) 0 / 0 3
900 P1808A   Lucky Numbers 0 / 0 3
899 P1808B   Playing in a Casino 0 / 0 4
898 P1808C   Unlucky Numbers 0 / 0 6
897 P1808D   Petya, Petya, Petr, and Palindromes 0 / 0 7
896 P1808E1   Minibuses on Venus (easy version) 0 / 0 8
895 P1808E2   Minibuses on Venus (medium version) 0 / 0 9
894 P1808E3   Minibuses on Venus (hard version) 0 / 0 10
893 P1809A   Garland 0 / 0 3
892 P1809B   Points on Plane 0 / 0 3
891 P1809C   Sum on Subarrays 0 / 0 5
890 P1809D   Binary String Sorting 0 / 0 6
889 P1809E   Two Tanks 0 / 0 9
888 P1809F   Traveling in Berland 0 / 0 9
887 P1809G   Prediction 0 / 0 10
886 P1810A   Beautiful Sequence 0 / 0 3
885 P1810B   Candies 0 / 0 3
884 P1810C   Make It Permutation 0 / 0 4
883 P1810D   Climbing the Tree 0 / 0 5
882 P1810E   Monsters 0 / 0 7
881 P1810F   M-tree 0 / 0 10
880 P1810G   The Maximum Prefix 0 / 0 10
879 P1810H   Last Number 0 / 0 10
878 P1811A   Insert Digit 0 / 0 3
877 P1811B   Conveyor Belts 0 / 0 3
876 P1811C   Restore the Array 0 / 0 3
875 P1811D   Umka and a Long Flight 0 / 0 5
874 P1811E   Living Sequence 0 / 0 5
873 P1811F   Is It Flower? 0 / 0 7
872 P1811G1   Vlad and the Nice Paths (easy version) 0 / 0 7
871 P1811G2   Vlad and the Nice Paths (hard version) 0 / 0 8
870 P1812A   Are You a Robot? 0 / 0 (无)
869 P1812B   Was it Rated? 0 / 0 (无)
868 P1812C   Digits 0 / 0 (无)
867 P1812D   Trivial Conjecture 0 / 0 (无)
866 P1812E   Not a Geometry Problem 0 / 0 (无)
865 P1812F   Factorization 0 / 0 (无)
864 P1812G   Colour Vision 0 / 0 (无)
863 P1812H   Expected Twist 0 / 0 (无)
862 P1812I   Mountain Climber 0 / 0 (无)
861 P1812J   Unmysterious Language 0 / 0 (无)
860 P1814A   Coins 0 / 0 3
859 P1814B   Long Legs 0 / 0 5
858 P1814C   Search in Parallel 0 / 0 5
857 P1814D   Balancing Weapons 0 / 0 9
856 P1814E   Chain Chips 0 / 0 8
855 P1814F   Communication Towers 0 / 0 10
854 P1815A   Ian and Array Sorting 0 / 0 4
853 P1815B   Sum Graph 0 / 0 7
852 P1815C   Between 0 / 0 8
851 P1815D   XOR Counting 0 / 0 10
850 P1815E   Bosco and Particle 0 / 0 10
849 P1815F   OH NO1 (-2-3-4) 0 / 0 10
848 P1816A   Ian Visits Mary 0 / 0 3
847 P1816B   Grid Reconstruction 0 / 0 3
846 P1817A   Almost Increasing Subsequence 0 / 0 5
845 P1817B   Fish Graph 0 / 0 6
844 P1817C   Similar Polynomials 0 / 0 9
843 P1817D   Toy Machine 0 / 0 10
842 P1817E   Half-sum 0 / 0 10
841 P1817F   Entangled Substrings 0 / 0 10
840 P1818A   Politics 0 / 0 3
839 P1818B   Indivisible 0 / 0 3
838 P1819A   Constructive Problem 0 / 0 4
837 P1819B   The Butcher 0 / 0 6
836 P1819C   The Fox and the Complete Tree Traversal 0 / 0 9
835 P1819D   Misha and Apples 0 / 0 10
834 P1819E   Roads in E City 0 / 0 10
833 P1819F   Willy-nilly, Crack, Into Release! 0 / 0 10
832 P1820A   Yura's New Name 0 / 0 3
831 P1820B   JoJo's Incredible Adventures 0 / 0 3
830 P1821A   Matching 0 / 0 3
829 P1821B   Sort the Subarray 0 / 0 3
828 P1821C   Tear It Apart 0 / 0 4
827 P1821D   Black Cells 0 / 0 6
826 P1821E   Rearrange Brackets 0 / 0 7
825 P1821F   Timber 0 / 0 10
824 P1822A   TubeTube Feed 0 / 0 3
823 P1822B   Karina and Array 0 / 0 3
822 P1822C   Bun Lover 0 / 0 3
821 P1822D   Super-Permutation 0 / 0 4
820 P1822E   Making Anti-Palindromes 0 / 0 5
819 P1822F   Gardening Friends 0 / 0 5
818 P1822G1   Magic Triples (Easy Version) 0 / 0 5
817 P1822G2   Magic Triples (Hard Version) 0 / 0 8
816 P1823A   A-characteristic 0 / 0 3
815 P1823B   Sort with Step 0 / 0 3
814 P1823C   Strongly Composite 0 / 0 4
813 P1823D   Unique Palindromes 0 / 0 6
812 P1823E   Removing Graph 0 / 0 9
811 P1823F   Random Walk 0 / 0 10
810 P1824A   LuoTianyi and the Show 0 / 0 4
809 P1824B1   LuoTianyi and the Floating Islands (Easy Version) 0 / 0 6
808 P1824B2   LuoTianyi and the Floating Islands (Hard Version) 0 / 0 8
807 P1824C   LuoTianyi and XOR-Tree 0 / 0 9
806 P1824D   LuoTianyi and the Function 0 / 0 10
805 P1824E   LuoTianyi and Cartridge 0 / 0 10

分类

试试手气

根据当前过滤条件随机选择一道题