- 博客(5)
- 收藏
- 关注
RSS订阅转载 Problem E : Online Judge
Problem E : Online JudgeFrom: HDU, 1073Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionIgnatius is building an Online Judge, now he has worked out all the problems except the Judge System. The sy
2021-04-15 19:39:24
78
原创 Problem D : SPY/HDU, 3527
Problem D : SPYFrom: HDU, 3527Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionThe National Intelligence Council of X Nation receives a piece of credible information that Nation Y will send spies t
2021-04-14 23:08:44
197
原创 Problem C : Easier Done Than Said?
Problem C : Easier Done Than Said?From: HDU, 1039Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionPassword security is a tricky thing. Users prefer simple passwords that are easy to remember (like
2021-04-14 22:12:14
75
原创 Problem B : Encoding
Problem B : EncodingFrom: HDU, 1020Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionGiven a string containing only ‘A’ - ‘Z’, we could encode it using the following method:Each sub-string contai
2021-04-14 20:00:00
108
原创 Problem A : 圆桌问题
Problem A : 圆桌问题From: HDU, 4841Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Problem Description圆桌上围坐着2n个人。其中n个人是好人，另外n个人是坏人。如果从第一个人开始数数，数到第m个人，则立即处死该人；然后从被处死的人之后开始数数，再将数到的第m个人处死……依此方法不断处死围坐在圆桌上的人。试问预先应如何安排这些好人与坏人
2021-04-14 17:06:18
206
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人