HDU1757 - A Simple Math Problem - 矩阵快速幂

最新推荐文章于 2021-04-08 19:21:24 发布

寒江雪里独钓着的蓑笠翁

最新推荐文章于 2021-04-08 19:21:24 发布

阅读量454

点赞数 1

CC 4.0 BY-SA版权

分类专栏：快速幂文章标签： acm 算法 hdu

本文链接：https://blog.youkuaiyun.com/dragon60066/article/details/60473845

1.题目描述

A Simple Math Problem

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4507 Accepted Submission(s): 2716

Problem Description

Lele now is thinking about a simple function f(x).

If x < 10 f(x) = x.
If x >= 10 f(x) = a0 * f(x-1) + a1 * f(x-2) + a2 * f(x-3) + …… + a9 * f(x-10);
And ai(0<=i<=9) can only be 0 or 1 .

Now, I will give a0 ~ a9 and two positive integers k and m ,and could you help Lele to caculate f(k)%m.

Input

The problem contains mutiple test cases.Please process to the end of file.
In each case, there will be two lines.
In the first line , there are two positive integers k and m. ( k<2*10^9 , m < 10^5 )
In the second line , there are ten integers repres