矩阵快速幂
HonniLin
double fighting
展开
-
HDU 1757-A Simple Math Problem(矩阵快速幂)
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2482 Accepted Submission(s): 1443Problem DescriptionLele now is thinking about a si原创 2014-07-26 09:05:51 · 1031 阅读 · 0 评论 -
HDU 1575-Tr A (矩阵快速幂裸题)
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2609 Accepted Submission(s): 1943Problem DescriptionA为一个方阵,则Tr A表示A的迹(就是主对角线上各项的和),原创 2014-07-26 09:09:19 · 767 阅读 · 0 评论 -
HDU 2604-Queuing
F[0] = 0 , F[1] = 2 , F[2] = 4 , F[3] = 6 , F[4] = 9 , F[5] = 15n >= 5原创 2014-07-26 09:16:08 · 566 阅读 · 0 评论 -
hdu 2256-Problem of Precision
Description InputThe first line of input gives the number of cases, T. T test cases follow, each on a separate line. Each test case contains one positive integer n. (1原创 2014-07-30 11:04:41 · 611 阅读 · 0 评论 -
ZOJ 2974-Just Pour the Water(矩阵快速幂)
DescriptionShirly is a very clever girl. Now she has two containers (A and B), each with some water. Every minute, she pours half of the water in A into B, and simultaneous pours half of the water原创 2014-08-15 15:08:38 · 825 阅读 · 0 评论 -
HDU 4684 - Arc of Dream(矩阵快速幂)
Problem DescriptionAn Arc of Dream is a curve defined by following function:wherea0 = A0ai = ai-1*AX+AYb0 = B0bi = bi-1*BX+BYWhat is the value of AoD(N) modulo 1,000,000,007? I原创 2015-01-27 16:24:01 · 614 阅读 · 0 评论