Lngxling的博客

FibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16668 Accepted: 11670DescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn =

思路：移项得到Fn=Fn-1-Fn-2构造矩阵1 -11 0注意long long  取模 和n=1和2的情况#include <iostream>#include <cstdio>#include <cmath>#include <vector>#include <map>#include <s...

题意：矩阵第0行第一个数是233，第二个数是2333，第三个数是23333ai,j = a i-1,j +a i,j-1，给第0列的数，计算a i,j思路：行数很少，只有10先考虑第0行，递推式为a0,j = 10*a0,j-1 + 3 a0,0的位置可以看作23然后很容易得到 ai,j=ai,j-1+ai-1,j-1+ai-2j-1+...10*a0,j-1+3 最多有1...

题意：n最大是1000，k最大是6，矩阵A规模n*k，矩阵B规模k*n，求矩阵(A*B)^(n*n)次方中每个数模6的和思路：求矩阵的幂可以用快速幂解决，但A*B最大是1000×1000的，快速幂的复杂度是1e9，会T把（A*B）^（n*n）展开可以得到（A*B）^（n*n）=A*B  *  A*B  *  A*B  *....=A  *  B*A  *  B*A  *...

D. Iterated Linear Functiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputConsider a linear function f(x) 

How many ways??Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4528    Accepted Submission(s): 1791Problem Description春天到了, HDU校

Recursive sequenceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2631    Accepted Submission(s): 1186Problem DescriptionFarmer

Consider recurrent functions of the following form:f(n) = a1f(n − 1) + a2f(n − 2) + a3f(n − 3) + . . . + adf(n − d), for n > d,where a1, a2, . . . , ad are arbitrary constants.A famous example i

Problem 1683 纪念SlingShotAccept: 719    Submit: 2492Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem Description已知 F（n）=3 * F（n-1）+2 * F（n-2）+7 * F（n-3），n>=3，其中F（0）=1，F（1）=3，F

A. Planttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDwarfs have planted a very interesting plant, whic

Fibonacci Check-upTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1653    Accepted Submission(s): 935Problem DescriptionEvery AL

Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 24975 Accepted: 10346DescriptionGiven a n × n matrix A and a positive integer k,

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

题意：由给定的代码求第n个数模m思路：看代码能够得到，奇数an=4*an-2+1,偶数an=4*an-2+2所以直接分奇偶分别构造矩阵，快速幂#include <bits/stdc++.h>using namespace std;#define mod m#define ll long longll n;ll m;ll num[20];struct ...