2013 年 6月 2 日随笔档案 - 可笑痴狂

2013年6月2日

摘要： Humble NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12573Accepted Submission(s): 5509Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16 阅读全文

posted @ 2013-06-02 21:05 可笑痴狂阅读(603) 评论(0) 推荐(0)

POJ-3070Fibonacci（矩阵快速幂求Fibonacci数列）

摘要： FibonacciTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7241Accepted: 5131DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …An alternative formul 阅读全文

posted @ 2013-06-02 17:08 可笑痴狂阅读(13452) 评论(1) 推荐(2)