5563 道题

ID 题目 显示标签 隐藏标签 AC / 尝试 难度
6874 CF1915D   Unnatural Language Processing 1 / 1 10
6875 CF1915E   Romantic Glasses 1 / 1 10
6876 CF1915F   Greetings 1 / 2 10
6877 CF1915G   Bicycles 1 / 3 10
6878 CF1926A   Vlad and the Best of Five 1 / 2 10
6879 CF1926B   Vlad and Shapes 1 / 1 10
6880 CF1926C   Vlad and a Sum of Sum of Digits 1 / 1 10
6881 CF1926D   Vlad and Division 1 / 1 10
6882 CF1926E   Vlad and an Odd Ordering 1 / 1 10
6883 CF1926F   Vlad and Avoiding X 1 / 1 10
6884 CF1926G   Vlad and Trouble at MIT 1 / 1 10
6885 CF1950A   Stair, Peak, or Neither? 1 / 1 10
6886 CF1950B   Upscaling 1 / 1 10
6887 CF1950C   Clock Conversion 1 / 1 10
6888 CF1950D   Product of Binary Decimals 1 / 1 10
6889 CF1950E   Nearly Shortest Repeating Substring 1 / 1 10
6890 CF1950F   0, 1, 2, Tree! 1 / 1 10
6891 CF1950G   Shuffling Songs 1 / 1 10
6892 CF1971A   My First Sorting Problem 1 / 1 10
6893 CF1971B   Different String 1 / 1 10
6894 CF1971C   Clock and Strings 1 / 1 10
6895 CF1971D   Binary Cut 1 / 1 10
6896 CF1971E   Find the Car 1 / 1 10
6897 CF1971F   Circle Perimeter 1 / 1 10
6898 CF1971G   XOUR 1 / 1 10
6899 CF1971H   ±1 1 / 1 10
6900 CF1985A   Creating Words 1 / 1 10
6901 CF1985B   Maximum Multiple Sum 1 / 1 10
6902 CF1985C   Good Prefixes 1 / 1 10
6903 CF1985D   Manhattan Circle 1 / 1 10
6904 CF1985E   Secret Box 1 / 1 10
6905 CF1985F   Final Boss 1 / 1 10
6906 CF1985G   D-Function 1 / 1 10
6907 CF1985H1   Maximize the Largest Component (Easy Version) 1 / 1 10
6908 CF1985H2   Maximize the Largest Component (Hard Version) 1 / 2 10
6909 CF1999A   A+B Again? 2 / 3 10
6910 CF1999B   Card Game 1 / 2 10
6911 CF1999C   Showering 1 / 1 10
6912 CF1999D   Slavic's Exam 1 / 2 10
6913 CF1999E   Triple Operations 1 / 1 10
6914 CF1999F   Expected Median 1 / 1 10
6915 CF2009A   Minimize! 1 / 1 10
6916 CF2009B   osu!mania 1 / 1 10
6917 CF2009C   The Legend of Freya the Frog 1 / 1 10
6918 CF2009D   Satyam and Counting 1 / 1 10
6919 CF2009E   Klee's SUPER DUPER LARGE Array!!! 1 / 1 10
6920 CF2009F   Firefly's Queries 1 / 1 10
6921 CF2009G1   Yunli's Subarray Queries (easy version) 1 / 1 10
6922 CF2009G2   Yunli's Subarray Queries (hard version) 1 / 1 10
6923 CF2009G3   Yunli's Subarray Queries (extreme version) 1 / 1 10

分类

试试手气

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

📖 答疑联系
QQ
2311359934
电话
17372905425
微信
jsjStudy
  1. 评测队列
  2. 服务状态
  3. 兼容模式
  4. 主题
  3. Worker 0, 80ms
  4. Powered by Hydro v5.0.0-beta.18 Community