原题传送门:http://acm.hdu.edu.cn/showproblem.php?pid=1757
A Simple Math Problem
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2480 Accepted Submission(s): 1441
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.
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 represent a0 ~ a9.
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 represent a0 ~ a9.
Output
For each case, output f(k) % m in one line.
Sample Input
10 9999
1 1 1 1 1 1 1 1 1 1
20 500
1 0 1 0 1 0 1 0 1 0
Sample Output
45
104
Author
linle
Source
Recommend
分析:这道题如果用打表或者递归肯定都是TLE的,那么我们可以用什么办法解决呢。。答案当然是矩阵快速幂。关键在于矩阵怎么构造了= =,这个矩阵也不难构造,就拿第一个例子来说,我们可以构造矩阵
1 1 1 1 1 1 1 1 1 1
1
1 0
1
0 。
。
1 0
只要学过矩阵乘法运算,估计都应该已经知道怎么回事了!
#include<cstdio> #include<cstring> int k,m,ans; struct Matrix{ int mat[10][10]; Matrix operator *(const Matrix rhs) const { Matrix temp; for(int i=0;i<10;i++){ for(int j=0;j<10;j++){ temp.mat[i][j] = 0; for(int k=0;k<10;k++){ temp.mat[i][j] += (this->mat[i][k] * rhs.mat[k][j])%m; temp.mat[i][j] %= m; } } } return temp; } }; Matrix ret,mt; int main(){ while(~scanf("%d%d",&k,&m)) { ans = 0; memset(ret.mat,0,sizeof(ret.mat)); memset(mt.mat,0,sizeof(mt.mat)); for(int i=0;i<10;i++) ret.mat[i][i] = 1; for(int i=0;i<10;i++) scanf("%d",&mt.mat[0][i]); for(int i=1;i<10;i++) mt.mat[i][i-1] = 1; k = k-9; while(k) { if(k&1) ret = ret * mt; k>>=1; mt = mt*mt; } for(int i=0;i<10;i++) ans = (ans + ret.mat[0][i]*(9-i))%m; printf("%d\n",ans); } return 0; }
相关推荐
HDU 1022 Train Problem I 附详细思路
A simple SDK for HDU. hdu-api 是一个集结 HDU 所有教务管理服务的 SDK,提供了一卡通服务、考试、课表、选课和一些公共信息如空闲教室、上课时间等信息的 API。 hdu-api 主要基于 Requests 库和 Beautiful Soup 库...
考试类精品--A simple SDK for HDU. 一个提供一卡通服务、考试、课表、选课和公共信息等 API
HDU的1250,主要是利用高精度加法,但是代码有点繁琐,效率不是很高
Problem Description 话说,经过了漫长的一个多月,小明已经成长了许多,所以他改了一个名字叫“大明”。 这时他已经不是那个只会做100以内加法的那个“小明”了,现在他甚至会任意长度的正小数的加法。 现在,给你...
杭电ACMhdu1163
HDU1059的代码
The first line of the input will contain a single integer indicating the number of problem instances. Each instance will consist of a single line of the form m n1 n2 n3 ... nm where m is the number ...
hdu1001解题报告
hdu 1574 passed sorce
HDU的一题........HDU DP动态规
hdu2101AC代码
hdu acm 教案 搜索入门 hdu acm 教案 搜索入门
搜索 dfs 解题代码 hdu1241
hdu 5007 Post Robot 字符串枚举。 暴力一下就可以了。
hdu_2102_passed_sorce
hdu acm 教案 动态规划(1) hdu acm 教案 动态规划(1)
hdu 1166线段树代码
ACM HDU题目分类,我自己总结的大概只有十来个吧