HDU 4549 M斐波那契数列(矩阵快速幂+欧拉定理)
摘要:
M斐波那契数列Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 353Accepted Submission(s): 93Problem DescriptionM斐波那契数列F[n]是一种整数数列,它的定义如下:F[0] = aF[1] = bF[n] = F[n-1] * F[n-2] ( n > 1 )现在给出a, b, n,你能求出F[n]的值吗?Input输入包含多组测试数据;每组数据占一行,包含3个整数a, b, n( 0 < 阅读全文
posted @ 2013-05-21 15:11 kuangbin 阅读(3193) 评论(5) 推荐(1) 编辑