A Simple Math Problem（矩阵快速幂）

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 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

矩阵快速幂的应用，还不怎么会用。。。
代码如下：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int k,m;
struct Maxtri
{int r,c;int a[15][15];
};
Maxtri ori,res;
void init()
{memset(res.a,0,sizeof(res.a));for(int i=1;i<=10;i++)res.a[i][i]=1;for(int i=2;i<=10;i++)for(int j=1;j<=10;j++){if(i-1!=j)ori.a[i][j]=0;elseori.a[i][j]=1;}
}
Maxtri maxtri(Maxtri x,Maxtri y)
{Maxtri z;memset(z.a,0,sizeof(z.a));for(int i=1;i<=10;i++){for(int k=1;k<=10;k++){if(x.a[i][k]==0)    continue;for(int j=1;j<=10;j++)z.a[i][j]=(z.a[i][j]+(x.a[i][k]*y.a[k][j])%m)%m;//这一点取模一定要注意，错了n遍 }}return z;
}
void maxtri_mod(int n)
{while(n){if(n%2!=0)res=maxtri(res,ori);ori=maxtri(ori,ori);n/=2;}
}
int main()
{while(scanf("%d%d",&k,&m)!=EOF){for(int i=1;i<=10;i++)scanf("%d",&ori.a[1][i]);init();if(k<=9){printf("%d\n",k%m);continue;}maxtri_mod(k-9);int sum=0;for(int i=1;i<=10;i++){sum+=(res.a[1][i]*(10-i))%m;sum%=m;}printf("%d\n",sum%m);}return 0;
}

努力加油a啊，(^o)/~

A Simple Math Problem（矩阵快速幂）相关推荐

HDU - 1757 A Simple Math Problem(矩阵快速幂，水题)
题目链接:点击查看题目大意:实现公式: f(x)=x,x<10 f(x)=a0*f(x-1)+a1*f(x-2)+--+a9*f(x-10) 题目给出a0~a9,一个n和一个m,要求输出f(n ...
HDU 1757 A Simple Math Problem (矩阵快速幂)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1757 在吴神的帮助下才明白如何构造矩阵,还是好弱啊. 此处盗一张图 1 #include <io ...
DUToj1085 Water Problem(矩阵快速幂)
Problem I: Water Problem Time Limit:3000/1000 MS (Java/Others) Memory Limit:163840/131072 KB (Java ...
A Simple Math Problem 矩阵打水题
A Simple Math Problem Lele now is thinking about a simple function f(x). If x < 10 f(x) = x. If x ...
HDU 4291 A Short problem 矩阵快速幂循环节
题解思路: 构造矩阵,矩阵乘法计算还是t; 需要找循环节; (注意因为是复合函数,不可以在里面取mod) 暴力跑只有可以找到g(222222224)%1e9==g(0)%1e9; 所以 g(g(n ...
【HDU - 1757】A Simple Math Problem （矩阵快速幂）
题干: Lele now is thinking about a simple function f(x). If x < 10 f(x) = x. If x >= 10 f(x) = ...
43行代码AC——HDU 1757 A Simple Math Problem（矩阵快速幂，附快速幂讲解）
一道经典的矩阵快速幂模板题. 传送门1-->快速幂基本思想传送门2-->矩阵快速幂讲解(教主传授) 代码(去掉空行43行) #include<iostream> #inclu ...
HDOJ 1757 A Simple Math Problem（矩阵快速幂）
2018-5-24 简单的矩阵快速幂问题,重点是如何找到对应关系. f(10) a0 a1 a2 a3 a4 a5 a6 a7 a8 a9 f(9) f(9) 1 0 0 0 0 0 0 0 0 0 ...
HDU 1757 A Simple Math Problem（矩阵快速幂）
题目链接题意 :给你m和k, 让你求f(k)%m.如果k<10,f(k) = k,否则 f(k) = a0 * f(k-1) + a1 * f(k-2) + a2 * f(k-3) + -- ...

A Simple Math Problem（矩阵快速幂）

A Simple Math Problem（矩阵快速幂）相关推荐

最新文章

热门文章