236 道题

ID 题目 显示标签 隐藏标签 AC / 尝试 难度
7115 CF1915E   Romantic Glasses 0 / 0 (无)
7116 CF1915F   Greetings 0 / 0 (无)
7117 CF1915G   Bicycles 1 / 1 10
7118 CF1926A   Vlad and the Best of Five 2 / 2 10
7119 CF1926B   Vlad and Shapes 1 / 2 10
7120 CF1926C   Vlad and a Sum of Sum of Digits 0 / 0 (无)
7121 CF1926D   Vlad and Division 0 / 0 (无)
7122 CF1926E   Vlad and an Odd Ordering 0 / 0 (无)
7123 CF1926F   Vlad and Avoiding X 0 / 0 (无)
7124 CF1926G   Vlad and Trouble at MIT 0 / 0 (无)
7125 CF1950A   Stair, Peak, or Neither? 2 / 2 10
7126 CF1950B   Upscaling 0 / 0 (无)
7127 CF1950C   Clock Conversion 0 / 0 (无)
7128 CF1950D   Product of Binary Decimals 0 / 0 (无)
7129 CF1950E   Nearly Shortest Repeating Substring 0 / 0 (无)
7130 CF1950F   0, 1, 2, Tree! 0 / 0 (无)
7131 CF1950G   Shuffling Songs 0 / 0 (无)
7132 CF1971A   My First Sorting Problem 2 / 2 10
7133 CF1971B   Different String 1 / 3 10
7134 CF1971C   Clock and Strings 0 / 3 10
7135 CF1971D   Binary Cut 0 / 0 (无)
7136 CF1971E   Find the Car 0 / 0 (无)
7137 CF1971F   Circle Perimeter 0 / 0 (无)
7138 CF1971G   XOUR 0 / 0 (无)
7139 CF1971H   ±1 0 / 0 (无)
7140 CF1985A   Creating Words 0 / 0 (无)
7141 CF1985B   Maximum Multiple Sum 0 / 0 (无)
7142 CF1985C   Good Prefixes 0 / 0 (无)
7143 CF1985D   Manhattan Circle 0 / 0 (无)
7144 CF1985E   Secret Box 0 / 0 (无)
7145 CF1985F   Final Boss 0 / 0 (无)
7146 CF1985G   D-Function 1 / 1 10
7147 CF1985H1   Maximize the Largest Component (Easy Version) 0 / 0 (无)
7148 CF1985H2   Maximize the Largest Component (Hard Version) 0 / 0 (无)
7149 CF1999A   A+B Again? 2 / 2 10
7150 CF1999B   Card Game 1 / 5 10
7151 CF1999C   Showering 1 / 1 10
7152 CF1999D   Slavic's Exam 1 / 1 10
7153 CF1999E   Triple Operations 0 / 0 (无)
7154 CF1999F   Expected Median 0 / 0 (无)
7155 CF2009A   Minimize! 1 / 1 10
7156 CF2009B   osu!mania 1 / 4 10
7157 CF2009C   The Legend of Freya the Frog 5 / 17 8
7158 CF2009D   Satyam and Counting 0 / 0 (无)
7159 CF2009E   Klee's SUPER DUPER LARGE Array!!! 0 / 0 (无)
7160 CF2009F   Firefly's Queries 1 / 1 10
7161 CF2009G1   Yunli's Subarray Queries (easy version) 0 / 0 (无)
7162 CF2009G2   Yunli's Subarray Queries (hard version) 0 / 0 (无)
7163 CF2009G3   Yunli's Subarray Queries (extreme version) 1 / 1 10
7164 CF2044A   Easy Problem 1 / 1 10

分类

试试手气

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

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