acm_矩阵快速幂
小k安达
不乱于心,不困于情,不畏将来,不念过往,如此,安好!
展开
-
poj-3070-Fibonacci
Fibonacci(传送门)DescriptionIn 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 Fibonacci sequence are:0, 1, 1,原创 2017-08-10 10:16:01 · 1165 阅读 · 0 评论 -
hdu-1575-Tr A(矩阵快速幂入门题)
Tr A(题目链接)Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5471 Accepted Submission(s): 4108Problem DescriptionA为一个方阵,则Tr A表原创 2017-08-13 11:11:32 · 902 阅读 · 0 评论 -
hdu-2604-Queuing(矩阵快速幂)
QueuingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5990 Accepted Submission(s): 2611Problem DescriptionQueues and Priori原创 2017-08-14 11:10:47 · 395 阅读 · 0 评论 -
hdu-1757-A Simple Math Problem(矩阵快速幂入门题)
A Simple Math ProblemTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5157 Accepted Submission(s): 3128Problem DescriptionLele原创 2017-08-14 16:22:04 · 1302 阅读 · 0 评论