博客已搬迁到http://www.cnblogs.com/cniwoq/

A Simple Math Problem Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4283    Accepted Submission(s): 2573 Problem Description Lele

Fibonacci Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 13732   Accepted: 9728 Description In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn

Tr A Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4488    Accepted Submission(s): 3377 Problem Description A为一个方阵，则Tr A表示A的迹（就是主

题目传送门 矩阵加快速幂运算才发现这么好用。 根据递推公式f(i+1) = fi + (i+1)*(i+1) + (i+1)构造矩阵 | f(i) + (i+1)*(i+1) + (i+1) |                  | 1    1    1    0 |        |      f(1)      | |       (i + 2)*(i + 2)