随笔分类 -  ACM-OJ-HDU

上一页 1 2
7.18
摘要：题目链接：HDU 5719 Arrange 昨天的B题，昨天做的时候没注意所有谷堆是全排列，看了Clarification才知道，可是不会做。 实际上只需要将自己的代码改动一步就可以了count = count*(c[i]-b[i]-i+2)%mod，也即c[i]-b[i]+1-(i-1) 看这个样 阅读全文
posted @ 2016-07-18 23:24 卷珠帘 阅读(228) 评论(0) 推荐(0)
HDU 5547 暴力
摘要：Sudoku Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1064 Accepted Submission(s): 362 Problem D 阅读全文
posted @ 2016-07-14 09:19 卷珠帘 阅读(302) 评论(0) 推荐(0)
高精度加法模板
摘要：只想说这个模板好啊 阅读全文
posted @ 2016-05-14 18:50 卷珠帘 阅读(295) 评论(0) 推荐(0)
一个人的旅行HDU 2066 floyd
摘要：一个人的旅行 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 29572 Accepted Submission(s): 10160 Proble 阅读全文
posted @ 2016-05-06 00:38 卷珠帘 阅读(288) 评论(0) 推荐(0)
最短路 HDU 2544
摘要：最短路 Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 50686 Accepted Submission(s): 22280 Problem D 阅读全文
posted @ 2016-05-04 00:20 卷珠帘 阅读(133) 评论(0) 推荐(0)
Claris and XOR(模拟）
摘要：Claris and XOR Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 332 Accepted Submission(s): 135 Pr 阅读全文
posted @ 2016-04-11 00:05 卷珠帘 阅读(375) 评论(0) 推荐(0)
CA Loves GCD
摘要：Problem Description CA is a fine comrade who loves the party and people; inevitably she loves GCD (greatest common divisor) too. Now, there are N diff 阅读全文
posted @ 2016-04-03 00:59 卷珠帘 阅读(321) 评论(0) 推荐(1)

上一页 1 2