摘要:
double 的精度就是屌骨牌铺方格Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21104 Accepted Submission(s): 10190Problem Description在2×n的一个长方形方格中,用一个1× 2... 阅读全文
摘要:
模算法+矩阵快速幂 FibonacciTime Limit:1000MSMemory Limit:65536KTotal Submissions:7138Accepted:5044DescriptionIn the Fibonacci integer sequence,F0= 0,F1= 1, andFn=Fn− 1+Fn− 2forn≥ 2. For example, the first ten terms of the Fibonacci sequence are:0, 1, 1, 2, 3, 5, 8, 1... 阅读全文