矩阵
关注
分享
扫一扫
听自己心跳的声音
一生大自在，万事将无同。
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
杭电1575 Tr A（矩阵快速幂）
Tr ATime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2967 Accepted Submission(s): 2209Problem DescriptionA为一个方阵，则Tr A表示A的迹（就是主对角线上原创 2014-10-21 22:33:17 · 786 阅读 · 0 评论 -
hdu5015 233 Matrix（构造矩阵）
233 MatrixTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1215 Accepted Submission(s): 714Problem DescriptionIn our daily life w原创 2015-03-30 09:53:01 · 585 阅读 · 0 评论 -
hdu4549 M斐波那契数列(矩阵快速幂)
M斐波那契数列Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1763 Accepted Submission(s): 508Problem DescriptionM斐波那契数列F[n]是一种整数数列，它的定义原创 2015-04-08 15:01:45 · 715 阅读 · 0 评论 -
uva10689 Yet another Number Sequence
Problem B Yet another Number Sequence Input: standard input Output: standard output Time Limit: 3 seconds Let's define another number sequence, given by the following function: f(0) = a原创 2015-04-08 16:12:50 · 758 阅读 · 0 评论 -
poj3233 Matrix Power Series(矩阵快速幂)
Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 16711 Accepted: 7126DescriptionGiven a n × n matrix A and a positive integer k, fi原创 2015-04-08 17:12:53 · 649 阅读 · 0 评论 -
hdu3306 Another kind of Fibonacci(构造矩阵)
Another kind of FibonacciTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1944 Accepted Submission(s): 747Problem DescriptionAs we原创 2015-04-14 21:27:10 · 563 阅读 · 0 评论 -
hdu4990 Reading comprehension
Reading comprehensionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 692 Accepted Submission(s): 295Problem DescriptionRead the p原创 2015-04-09 18:11:32 · 643 阅读 · 0 评论 -
NYOJ298 点的变换（经典矩阵应用）
点的变换时间限制：2000 ms | 内存限制：65535 KB难度：5描述平面上有不超过10000个点，坐标都是已知的，现在可能对所有的点做以下几种操作：平移一定距离(M)，相对X轴上下翻转(X)，相对Y轴左右翻转(Y),坐标缩小或放大一定的倍数(S),所有点对坐标原点逆时针旋转一定角度(R)。 操作的次数不超过1000000次，原创 2014-10-21 13:26:14 · 863 阅读 · 0 评论