摘要: A hard puzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 14975 Accepted Submission(s): 5314 Problem Descriptionlcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT prob. 阅读全文
posted @ 2011-11-26 22:02 Stephen Li 阅读(225) 评论(0) 推荐(0) 编辑
摘要: Square CoinsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4089Accepted Submission(s): 2782Problem DescriptionPeople in Silverland use square coins. Not only they have square shapes but also their values are square numbers. Coins with values of a 阅读全文
posted @ 2011-11-26 21:28 Stephen Li 阅读(484) 评论(0) 推荐(0) 编辑
摘要: 钱币兑换问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2351Accepted Submission(s): 1279Problem Description在一个国家仅有1分,2分,3分硬币,将钱N兑换成硬币有很多种兑法。请你编程序计算出共有多少种兑法。Input每行只有一个正整数N,N小于32768。Output对应每个输入,输出兑换方法数。Sample Input293412553Sample Output7188311313776 阅读全文
posted @ 2011-11-26 21:26 Stephen Li 阅读(302) 评论(0) 推荐(0) 编辑
摘要: Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5568Accepted Submission(s): 3925Problem Description"Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says. 阅读全文
posted @ 2011-11-26 21:19 Stephen Li 阅读(161) 评论(0) 推荐(0) 编辑