- 博客(10)
- 收藏
- 关注
RSS订阅原创 字串
Time Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & %llu问题描述对于长度为5位的一个01串，每一位都可能是0或1，一共有32种可能。它们的前几个是：0000000001000100001100100请按从小到大的顺序输出这32种01串。输入格式本试题没
2016-07-18 21:09:02
209
转载 今年暑假不AC
今年暑假不ACTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription“今年暑假不AC？” “是的。” “那你干什么呢？” “看世界杯呀，笨蛋！” “@#$%^&*%...” 确实如此，世界杯
2016-07-11 16:49:56
358
转载 Doing Homework again
Doing Homework againTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionIgnatius has just come back school from the 30th ACM/ICPC. N
2016-07-11 09:26:35
375
转载 Climbing Worm
Climbing Worm时间限制:1000女士内存限制:32768KB64位输入输出格式:%I64d & %I64u提交 状态描述An inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but th
2016-07-10 15:51:20
281
转载 Let the Balloon Rise
Let the Balloon RiseTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionContest time again! How excited it is to see balloons floati
2016-07-10 15:15:01
441
转载 圆桌会议
圆桌会议Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionHDU ACM集训队的队员在暑假集训时经常要讨论自己在做题中遇到的问题.每当面临自己解决不了的问题时,他们就会围坐在一张圆形的桌子旁进行交流,经过大家的
2016-07-10 13:48:20
323
转载 Jump and Jump...
Jump and Jump...Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThere are \(n\) kids and they want to know who can jump the fart
2016-07-10 13:43:04
541
转载 A+B for Input-Output Practice (VIII)
A+B for Input-Output Practice (VIII)Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionYour task is to calculate the sum of some in
2016-07-10 10:40:38
213
转载 {A} + {B}
B - {A} + {B}Time Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription给你两个集合，要求{A} + {B}. 注:同一个集合中不会有两个相同的元素. Input每组输入
2016-07-10 10:37:44
326
转载 超级楼梯
A - 超级楼梯Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription有一楼梯共M级，刚开始时你在第一级，若每次只能跨上一级或二级，要走上第M级，共有多少种走法？ Input输入数据首先
2016-07-10 10:31:43
206
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人