2013年9月4日

uva 10870 递推关系矩阵快速幂模

摘要: Recurrences Input:standard input Output:standard outputConsider recurrent functions of the following form:f(n) = a1f(n - 1) + a2f(n - 2) + a3f(n - 3) + ... + adf(n - d), for n > d. a1, a2, ..., ad- arbitrary constants.A famous example is the Fibonacci sequence, defined as: f(1) = 1, f(2) = 1, f(n 阅读全文

posted @ 2013-09-04 15:52 雄.. 阅读(221) 评论(0) 推荐(0)

导航