摘要: 以后就用统一用CSDN了,以前的一些ACM程序,自己有时间回顾下也能有所收获。 阅读全文
posted @ 2013-08-15 10:59 风之轻吟2012 阅读(103) 评论(0) 推荐(0) 编辑
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=4158GOTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 205Accepted Submission(s): 113Problem Description In the game of Go, two players alternate placing black and white stones on lattice points of an n  阅读全文
posted @ 2012-09-18 23:27 风之轻吟2012 阅读(240) 评论(0) 推荐(0) 编辑
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=4160DollsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 494 Accepted Submission(s): 221 Problem DescriptionDo you remember the box of Matryoshka dolls last week? Adam just got another box of dolls from M 阅读全文
posted @ 2012-08-31 10:36 风之轻吟2012 阅读(246) 评论(0) 推荐(0) 编辑
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=2063过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5243 Accepted Submission(s): 2320 Problem DescriptionRPG girls今天和大家一起去游乐场玩,终于可以坐上梦寐以求的过山车了。可是,过山车的每一排只有两个座位,而且还有条不成文的规矩,就是每个女生必须找个个男生做partner和她同坐。但是, 阅读全文
posted @ 2012-08-30 15:24 风之轻吟2012 阅读(543) 评论(0) 推荐(0) 编辑
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=4260The End of The WorldTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 259 Accepted Submission(s): 128 Problem DescriptionLegend says that there is a group of monks who are solving a large Towers of Hano 阅读全文
posted @ 2012-08-29 17:53 风之轻吟2012 阅读(318) 评论(0) 推荐(0) 编辑
摘要: http://acm.hnu.cn/online/?action=problem&type=show&id=12484&courseid=0Unique Encryption KeysTime Limit: 30000ms, Special Time Limit:75000ms, Memory Limit:65536KBTotal submit users: 19, Accepted users: 15Problem 12484 : Special judgeProblem descriptionThe security of many ciphers strongly 阅读全文
posted @ 2012-08-29 11:44 风之轻吟2012 阅读(337) 评论(0) 推荐(0) 编辑
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=1042N!Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 34360 Accepted Submission(s): 9611 Problem DescriptionGiven an integer N(0 ≤ N ≤ 10000), your task is to calculate N!InputOne N in one line, process 阅读全文
posted @ 2012-08-19 17:16 风之轻吟2012 阅读(202) 评论(0) 推荐(0) 编辑
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=1250Hat's FibonacciTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3943 Accepted Submission(s): 1346 Problem DescriptionA Fibonacci sequence is calculated by adding the previous two members the sequen 阅读全文
posted @ 2012-08-19 16:16 风之轻吟2012 阅读(271) 评论(0) 推荐(0) 编辑
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=1753大明A+BTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4947 Accepted Submission(s): 1646 Problem Description话说,经过了漫长的一个多月,小明已经成长了许多,所以他改了一个名字叫“大明”。 这时他已经不是那个只会做100以内加法的那个“小明”了,现在他甚至会任意长度的正小数的加法。现在,给你两个正 阅读全文
posted @ 2012-08-18 17:50 风之轻吟2012 阅读(232) 评论(0) 推荐(0) 编辑
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=1715大菲波数Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6655 Accepted Submission(s): 2203 Problem DescriptionFibonacci数列,定义如下: f(1)=f(2)=1 f(n)=f(n-1)+f(n-2) n>=3。 计算第n项Fibonacci数值。Input输入第一行为一个整数N,接下来 阅读全文
posted @ 2012-08-18 15:42 风之轻吟2012 阅读(713) 评论(0) 推荐(0) 编辑