HDU
文章平均质量分 78
porridgexj
大三CS学生
展开
-
2021CCPC华为云挑战赛 1001 对象存储调度问题
1001 对象存储调度问题Problem Description题目背景:在华为云的对象存储调度过程中,我们会把数据对象存入分条中,而当数据对象较小时,我们会考虑聚合多个对象到一个分条中。如图所示:题目描述:给定 n 个大小 A1,A2,⋯,An 为 2 的整数次幂的数据对象,以及 m 个剩余空间为 B1,B2,⋯,Bm 的分条。问是否可以通过对数据对象进行聚合,使得能用现有的 m 个分条把所有 n 个对象存下来。T 组数据。Input第一行一个正整数 T(1≤T≤1000),表示数据组数。对原创 2021-08-31 18:47:28 · 327 阅读 · 0 评论 -
2021中国大学生程序设计竞赛(CCPC)- 网络选拔赛 1009 Command Sequence
1009 Command SequenceProblem DescriptionThere is a robot that can move by receiving a sequence of commands.There are four types of command in the command sequence:U: robot moves one unit up.D: robot moves one unit down.L: robot moves one unit left.R原创 2021-08-29 10:52:59 · 716 阅读 · 0 评论 -
2021中国大学生程序设计竞赛(CCPC)- 网络选拔赛 1001 Cut The Wire
1001 Cut The WireProblem DescriptionIn the country of Infinity , there is a strange road. This road only has a starting point, but no end. Since this road is infinite, there are also countless street lights. The street lights are numbered from 1(the star原创 2021-08-29 10:27:16 · 487 阅读 · 0 评论 -
2021“MINIEYE杯”中国大学生算法设计超级联赛(8)1003 Ink on paper
Ink on paperProblem DescriptionBob accidentally spilled some drops of ink on the paper. The initial position of the i-th drop of ink is (xi,yi), which expands outward by 0.5 centimeter per second, showing a circle.The curious Bob wants to know how long原创 2021-08-12 19:27:25 · 578 阅读 · 0 评论