ID | 题目 显示标签 隐藏标签 | AC / 尝试 | 难度 | |
---|---|---|---|---|
214 | P1533B Nearest Point Function | 0 / 0 | (无) | |
213 | P1533C Sweets | 0 / 0 | (无) | |
212 | P1533D String Searching | 0 / 0 | (无) | |
211 | P1533E Chess Team Forming | 0 / 0 | (无) | |
210 | P1533F Binary String Partition | 0 / 0 | (无) | |
209 | P1533G Biome Map | 0 / 0 | (无) | |
208 | P1533H Submatrices | 0 / 0 | (无) | |
207 | P1533I Excursions | 0 / 0 | (无) | |
206 | P1533J Pawns | 0 / 0 | (无) | |
7281 | P1571J Two Railroads | 0 / 0 | (无) | |
7280 | P1576A Communication Routing Challenge | 0 / 0 | (无) | |
8237 | P1910A Username | 0 / 0 | 3 | |
8236 | P1910B Security Guard | 0 / 0 | 5 | |
8235 | P1910C Poisonous Swamp | 0 / 0 | 5 | |
8234 | P1910D Remove and Add | 0 / 0 | 6 | |
8233 | P1910E Maximum Sum Subarrays | 0 / 0 | 7 | |
8232 | P1910F Build Railway Stations | 0 / 0 | 7 | |
8231 | P1910G Pool Records | 0 / 0 | 10 | |
8230 | P1910H Sum of Digits of Sums | 0 / 0 | 9 | |
8229 | P1910I Inverse Problem | 0 / 0 | 10 | |
8228 | P1910J Two Colors | 0 / 0 | 10 |