ID 题目 显示标签 隐藏标签 AC / 尝试 难度
887 P1682A   Palindromic Indices 0 / 0 3
885 P1682C   LIS or Reverse LIS? 0 / 0 4
883 P1682E   Unordered Swaps 0 / 0 10
882 P1682F   MCMF? 0 / 0 10
879 P1684C   Column Swapping 0 / 0 4
878 P1684D   Traps 0 / 0 5
877 P1684E   MEX vs DIFF 0 / 0 7
873 P1685A   Circular Local MiniMax 0 / 0 3
872 P1685B   Linguistics 0 / 0 7
871 P1685C   Bring Balance 0 / 0 10
869 P1685D2   Permutation Weight (Hard Version) 0 / 0 10
868 P1685E   The Ultimate LIS Problem 0 / 0 10
867 P1686A   Everything Everywhere All But One 0 / 0 3
866 P1686B   Odd Subarrays 0 / 0 3
865 P1687A   The Enchanted Forest 0 / 0 5
864 P1687B   Railway System 0 / 0 5
863 P1687C   Sanae and Giant Robot 0 / 0 9
861 P1687E   Become Big For Me 0 / 0 10
858 P1688B   Patchouli's Magical Talisman 0 / 0 3
857 P1688C   Manipulating History 0 / 0 5
856 P1689A   Lex String 0 / 0 3
855 P1689B   Mystic Permutation 0 / 0 3
851 P1690A   Print a Pedestal (Codeforces logo?) 0 / 0 3
850 P1690B   Array Decrements 0 / 0 3
849 P1690C   Restoring the Duration of Tasks 0 / 0 3
847 P1690E   Price Maximization 0 / 0 5
845 P1690G   Count the Trains 0 / 0 7
844 P1691A   Beat The Odds 0 / 0 3
843 P1691B   Shoe Shuffling 0 / 0 3
842 P1691C   Sum of Substrings 0 / 0 4
840 P1691E   Number of Groups 0 / 0 8
837 P1692B   All Distinct 0 / 0 3
831 P1692H   Gambling 0 / 0 5
830 P1693A   Directional Increase 0 / 0 4
829 P1693B   Fake Plastic Trees 0 / 0 5
828 P1693C   Keshi in Search of AmShZ 0 / 0 8
827 P1693D   Decinc Dividing 0 / 0 10
826 P1693E   Outermost Maximums 0 / 0 10
825 P1693F   I Might Be Wrong 0 / 0 10
824 P1694A   Creep 0 / 0 3
823 P1694B   Paranoid String 0 / 0 4
821 P1695B   Circle Game 0 / 0 3
820 P1695C   Zero Path 0 / 0 5
819 P1695D1   Tree Queries (Easy Version) 0 / 0 8
818 P1695D2   Tree Queries (Hard Version) 0 / 0 8
816 P1696A   NIT orz! 0 / 0 3
815 P1696B   NIT Destroys the Universe 0 / 0 3
814 P1696C   Fishingprince Plays With Array 0 / 0 4
813 P1696D   Permutation Graph 0 / 0 6
809 P1696H   Maximum Product? 0 / 0 10

分类

手气不错

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