摘要: Queues and Priority Queues are data structures which are known to most computer scientists. TheTeam Queue, however, is not so well known, though it oc... 阅读全文
posted @ 2017-08-09 11:52 Pretty9 阅读(134) 评论(0) 推荐(0) 编辑
摘要: XX星球有很多城市,每个城市之间有一条或多条飞行通道,但是并不是所有的路都是很安全的,每一条路有一个安全系数s,s是在 0 和 1 间的实数(包括0,1),一条从u 到 v 的通道P 的安全度为Safe(P) = s(e1)*s(e2)…*s(ek) e1,e2,ek是P 上的边 ,... 阅读全文
posted @ 2017-08-09 11:09 Pretty9 阅读(135) 评论(0) 推荐(0) 编辑
摘要: XiaoY is living in a big city, there are N towns in it and some towns near the sea. All these towns are numbered from 0 to N-1 and XiaoY lives... 阅读全文
posted @ 2017-08-09 10:47 Pretty9 阅读(90) 评论(0) 推荐(0) 编辑
摘要: 六度分离Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10183 Accepted Submission(s): ... 阅读全文
posted @ 2017-08-09 09:32 Pretty9 阅读(152) 评论(0) 推荐(0) 编辑
摘要: HDU TodayTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 31274 Accepted Submissio... 阅读全文
posted @ 2017-08-09 09:26 Pretty9 阅读(123) 评论(0) 推荐(0) 编辑
摘要: 确定比赛名次Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28197 Accepted Submission(s): 11235Pr... 阅读全文
posted @ 2017-08-08 22:04 Pretty9 阅读(89) 评论(0) 推荐(0) 编辑
摘要: 不容易系列之(4)——考新郎Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 39072 Accepted Submission(s):... 阅读全文
posted @ 2017-08-08 21:51 Pretty9 阅读(157) 评论(0) 推荐(0) 编辑
摘要: 悼念512汶川大地震遇难同胞——选拔志愿者Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10034 Accepted Submiss... 阅读全文
posted @ 2017-08-08 21:36 Pretty9 阅读(127) 评论(0) 推荐(0) 编辑
摘要: Big NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38450 Accepted Submission(s): 186... 阅读全文
posted @ 2017-08-08 21:01 Pretty9 阅读(120) 评论(0) 推荐(0) 编辑
摘要: 输入两个正整数 n, m,输出 n!/m!,其中阶乘定义为 n!= 1*2*3*...*n (n>=1)。 比如,若 n=6, m=3,则n!/m!=6!/3!=720/6=120。 是不是很简单?现在让我们把问题反过来:输入 k=n!/m!,找到这样的整数二元组(n,m) (n>m>=1)。 如果 阅读全文
posted @ 2017-08-08 20:26 Pretty9 阅读(421) 评论(0) 推荐(0) 编辑