2013年11月30日
URAL1079
摘要： Problem ETime Limit : 4000/2000ms (Java/Other)Memory Limit : 32768/16384K (Java/Other)Total Submission(s) : 15Accepted Submission(s) : 7Problem DescriptionConsider the sequence of numbers ai, i = 0, 1, 2, …, which satisfies the following requirements:a0 = 0a1 = 1a2i = aia2i+1 = ai + ai+1for every i. 阅读全文
posted @ 2013-11-30 22:23 疯狂的癫子 阅读(159) 评论(0) 推荐(0)
POJ1218
摘要： Problem CTime Limit : 2000/1000ms (Java/Other)Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 9Accepted Submission(s) : 8Problem DescriptionA certain prison contains a long hall of n cells, each right next to each other. Each cell has a prisoner in it, and each cell is locked. One nig. 阅读全文
posted @ 2013-11-30 22:19 疯狂的癫子 阅读(212) 评论(0) 推荐(0)
POJ1664
摘要： Problem BTime Limit : 2000/1000ms (Java/Other)Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 10Accepted Submission(s) : 7Problem Description把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是同一种分法。Input第一行是测试数据的数目t（0 int find(int m,int n) { if(m==0||n==1) ret... 阅读全文
posted @ 2013-11-30 22:17 疯狂的癫子 阅读(163) 评论(0) 推荐(0)