dxx_111的博客

fibonacci数列(二) 时间限制：1000 ms  |  内存限制：65535 KB 难度：3 描述 In 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 Fibonacc

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

首先输入n,m； 然后输入一个n行n列的矩阵，然后让你计算这个矩阵的m次方所得到的矩阵！ #include #include #include using namespace std; int n,m; struct node//建立矩阵 { int r,c;//r代表行，c代表列 int a[105][105];//代表具体的值 }; node ori,r

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

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