2012年9月22日

HDU 4405 Aeroplane chess 第37届ACM/ICPC 金华赛区网络赛（递推求期望）

摘要： Aeroplane chessTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 229Accepted Submission(s): 158Problem DescriptionHzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws 阅读全文

posted @ 2012-09-22 22:48 kuangbin 阅读(984) 评论(0) 推荐(0)

HDU 4407 Sum 第37届ACM/ICPC 金华赛区 第1008题 （容斥原理）

摘要： SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 358Accepted Submission(s): 109Problem DescriptionXXX is puzzled with the question below: 1, 2, 3, ..., n (1<=n<=400000) are placed in a line. There are m (1<=m<=1000) operations of two 阅读全文

posted @ 2012-09-22 22:45 kuangbin 阅读(1688) 评论(0) 推荐(0)

HDU 4408 Minimum Spanning Tree 第37届ACM/ICPC 金华赛区网络赛1009 题 （最小生成树计数）

摘要： Minimum Spanning TreeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 205Accepted Submission(s): 65Problem DescriptionXXX is very interested in algorithm. After learning the Prim algorithm and Kruskal algorithm of minimum spanning tree, XXX finds th 阅读全文

posted @ 2012-09-22 21:20 kuangbin 阅读(2003) 评论(0) 推荐(0)

HDU 4403 A very hard Aoshu problem 第37届ACM/ICPC 金华赛区网络赛1004题

摘要： A very hard Aoshu problemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 137Accepted Submission(s): 100Problem DescriptionAoshu is very popular among primary school students. It is mathematics, but much harder than ordinary mathematics for primary 阅读全文

posted @ 2012-09-22 20:54 kuangbin 阅读(1041) 评论(0) 推荐(0)

导航

JAVASCRIPT: