潮鸣り

快速求正整数次幂，当然不能直接死乘。举个例子： 3 ^ 999 = 3 * 3 * 3 * … * 3 直接乘要做998次乘法。但事实上可以这样做，先求出2^k次幂： 3 ^ 2 = 3 * 3 3 ^ 4 = (3 ^ 2) * (3 ^ 2) 3 ^ 8 = (3 ^ 4) * (3 ^ 4) 3 ^ 16 = (3 ^ 8) * (3 ^ 8) 3 ^ 32 = (3 ^ 16

GTY's birthday gift Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 408    Accepted Submission(s): 154 Problem Description FFZ's birt

#define Matr 10 //矩阵大小,注意能小就小 struct mat//矩阵结构体，a表示内容，size大小 矩阵从1开始 { ll a[Matr][Matr],size; mat() { size=0; memset(a,0,sizeof(a)); } }; void print(mat m)//

题意就不多说了，一道基础的矩阵入门。 #include "stack" #include "cstdio" #include "iostream" #include "cmath" #include "set" #include "sstream" #include "cctype" #include "string" #include "cstring" #include "

/*构造矩阵 If x If x >= 10 f(x) = a0 * f(x-1) + a1 * f(x-2) + a2 * f(x-3) + …… + a9 * f(x-10); |f(10) | |a0 a1 a2 ...a8 a9| |f(9)| | f(9) | | 1 0 0 ... 0 0| |f(8)| | .....| = |.. ... ... ... ..| |