poj3233 又见矩阵,不过是等比吗?
摘要:
Given a n × n matrix A and a positive integer k, find the sum S = A + A^2 + A^3 + … + A^k.也许可以用等比数列的前n项来求和??? 阅读全文
posted @ 2011-08-09 11:44 ACShiryu 阅读(2377) 评论(7) 推荐(1)
2011年8月9日 #
posted @ 2011-08-09 11:44 ACShiryu 阅读(2377) 评论(7) 推荐(1)
In 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, 2, 3, 5, 8, 13, 21, 34, …
Given an integer n, your goal is to compute the last 4 digits of Fn. 阅读全文
posted @ 2011-08-09 11:11 ACShiryu 阅读(1629) 评论(1) 推荐(0)
posted @ 2011-08-09 10:54 ACShiryu 阅读(1863) 评论(0) 推荐(0)
posted @ 2011-08-09 10:53 ACShiryu 阅读(3609) 评论(7) 推荐(2)
posted @ 2011-08-09 10:10 ACShiryu 阅读(477) 评论(0) 推荐(0)
posted @ 2011-08-09 09:52 ACShiryu 阅读(662) 评论(0) 推荐(0)