矩阵
没有能与不能只有想与不想
这个作者很懒,什么都没留下…
展开
-
hdoj Secrete Master Plan 5540 (矩阵翻转)
Secrete Master PlanTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 121 Accepted Submission(s): 88Problem DescriptionMaster Mind KongMin原创 2015-11-07 13:44:14 · 535 阅读 · 0 评论 -
hdoj So Easy! 4565 (矩阵连乘&反推)好题
So Easy!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3432 Accepted Submission(s): 1097Problem Description A sequence Sn is de原创 2016-02-27 15:01:33 · 452 阅读 · 0 评论 -
nefu A Simple Math Problem 459 (矩阵连乘)
A Simple Math ProblemProblem : 459Time Limit : 1000msMemory Limit : 65536KdescriptionLele now is thinking about a simple functio原创 2016-02-27 14:19:33 · 279 阅读 · 0 评论 -
nefu Another kind of Fibonacci 458 (矩阵连乘)
Another kind of FibonacciProblem : 458Time Limit : 1000msMemory Limit : 65536KdescriptionAs we all known , the Fibonacci series原创 2016-02-27 14:08:04 · 853 阅读 · 0 评论 -
nefu Not Fibonacci 457 (矩阵连乘)
Not FibonacciProblem : 457Time Limit : 1000msMemory Limit : 65536KdescriptionMaybe ACMers of HIT are always fond of fibonacci nu原创 2016-02-27 14:02:45 · 290 阅读 · 0 评论 -
矩阵连乘求斐波那契数列模板
#include#include#include#include#include#define ll long long#define M 1000000007#define N 2using namespace std;struct mat{ ll m[N][N];};mat A={ 1,1, 1,0};mat I={ 1,0, 0,1};mat m原创 2016-02-27 13:55:23 · 600 阅读 · 0 评论 -
nefu fibs的位数 461 (矩阵)
fibs的位数Problem : 461Time Limit : 1000msMemory Limit : 65536Kdescription广义的Fibonacci数列定义如下:R0=a;R1= b;Rn= uRn-1 + vRn-2 (n >=原创 2016-02-27 13:45:58 · 351 阅读 · 0 评论 -
poj Matrix Power Series 3233 (矩阵快速幂&二分)好题
Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 19132 Accepted: 8070DescriptionGiven a n × n matrix A and a positive integer k, find原创 2016-03-02 22:14:44 · 323 阅读 · 0 评论 -
hdoj M斐波那契数列 4549&nyoj 又见斐波那契数列 1000 (矩阵快速幂&规律)
M斐波那契数列Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2416 Accepted Submission(s): 701Problem DescriptionM斐波那契数列F[n]是一种整数数列,它的定义原创 2016-03-02 20:43:33 · 452 阅读 · 0 评论 -
nyoj A*B Problem II 623 (矩阵相乘)
A*B Problem II时间限制:1000 ms | 内存限制:65535 KB难度:1描述 ACM的C++同学有好多作业要做,最头痛莫过于线性代数了,因为每次做到矩阵相乘的时候,大量的乘法都会把他搞乱,所以他想请你写个程序帮他检验一下计算结果是否正确。输入有多组测试数据,每行给出一组m,n,k(0矩阵A:m行n列。矩阵B:n行k列。原创 2016-03-02 18:50:21 · 712 阅读 · 0 评论 -
nyoj fibonacci数列(二) 148 (矩阵快速幂模板)
fibonacci数列(二)时间限制:1000 ms | 内存限制:65535 KB难度:3描述 In the Fibonacci integer sequence, F0 = 0, F1 = 1, andFn = Fn − 1 + Fn − 2 forn ≥ 2. For example, the first ten terms of the Fibonacc原创 2016-03-02 18:16:15 · 396 阅读 · 0 评论 -
hdoj Matrix multiplication 4920 (矩阵相乘)
Matrix multiplicationTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 3841 Accepted Submission(s): 1577Problem DescriptionGiven原创 2015-11-07 22:23:36 · 279 阅读 · 0 评论 -
hdoj Ipad,IPhone 3802 (矩阵连乘) 好题
Ipad,IPhoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 350 Accepted Submission(s): 128Problem DescriptionIn ACM_DIY, there is原创 2016-02-27 15:27:42 · 373 阅读 · 0 评论