hdu 5015
来源:互联网 发布:mac safari历史记录 编辑:程序博客网 时间:2024/06/06 01:25
Problem Description
In our daily life we often use 233 to express our feelings. Actually, we may say 2333, 23333, or 233333 ... in the same meaning. And here is the question: Suppose we have a matrix called 233 matrix. In the first line, it would be 233, 2333, 23333... (it means a0,1 = 233,a0,2 = 2333,a0,3 = 23333...) Besides, in 233 matrix, we got ai,j = ai-1,j +ai,j-1( i,j ≠ 0). Now you have known a1,0,a2,0,...,an,0, could you tell me an,m in the 233 matrix?
Input
There are multiple test cases. Please process till EOF.
For each case, the first line contains two postive integers n,m(n ≤ 10,m ≤ 109). The second line contains n integers, a1,0,a2,0,...,an,0(0 ≤ ai,0 < 231).
For each case, the first line contains two postive integers n,m(n ≤ 10,m ≤ 109). The second line contains n integers, a1,0,a2,0,...,an,0(0 ≤ ai,0 < 231).
Output
For each case, output an,m mod 10000007.
Sample Input
1 112 20 03 723 47 16
Sample Output
234279972937
Hint
矩阵的第一列为:
0
a[1]
a[2]
a[3]
a[4]
可以变换一下:
23
a[1]
a[2]
a[3]
a[4]
3
我们可以一列一列转移,这样就可以轻松求得a[n][m]
那么由第一列转移到第二列则为
23*10+3
a[1]+23*10+3
a[2]+a[1]+23*10+3
a[3]+a[2]+a[1]+23*10+3
a[4]+a[3]+a[2]+a[1]+23*10+3
3
那么矩阵A就是
10 0 0 0 0 1
10 1 0 0 0 1
10 1 1 0 0 1
10 1 1 1 0 1
10 1 1 1 1 1
0 0 0 0 0 1
答案就是第n行(下标从0开始)的每一个数分别乘以a数组第一列的每一个数的和。
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#define LL long longusing namespace std;const int mod = 10000007;struct Matrix{ long long m[12][12]; int n; Matrix(int x) { n = x; for(int i=0;i<n;i++) for(int j=0;j<n;j++) m[i][j] = 0; } Matrix(int _n,int a[12][12]) { n = _n; for(int i=0;i<n;i++) for(int j=0;j<n;j++) { m[i][j] = a[i][j]; } }};Matrix operator *(Matrix a,Matrix b){ int n = a.n; Matrix ans = Matrix(n); for(int i=0;i<n;i++) for(int j=0;j<n;j++) for(int k=0;k<n;k++) { ans.m[i][j] += (a.m[i][k]%mod)*(b.m[k][j]%mod)%mod; ans.m[i][j] %= mod; } return ans;}Matrix operator ^(Matrix a,int k){ int n = a.n; Matrix c(n); int i,j; for(i=0;i<n;i++) for(j=0;j<n;j++) c.m[i][j] = (i==j); for(;k;k>>=1) { if(k&1) c=c*a; a = a*a; } return c;}int a[15];int main(void){ int n,m,i,j; while(scanf("%d%d",&n,&m)==2) { a[0] = 23; for(i=1;i<=n;i++) scanf("%d",&a[i]); a[n+1] = 3; Matrix A = Matrix(n+2); for(i=0;i<=n;i++) { A.m[i][0] = 10; for(j=1;j<=i;j++) { A.m[i][j] = 1; } for(j=i+1;j<=n;j++) A.m[i][j] = 0; A.m[i][n+1] = 1; } for(j=0;j<=n;j++) A.m[n+1][j] = 0; A.m[n+1][n+1] = 1; A = A^(m); LL ans = 0; for(i=0;i<=n+1;i++) { ans = (ans + A.m[n][i]*a[i]%mod)%mod; } printf("%lld\n",ans); } return 0;}
阅读全文
0 0
- hdu 5015
- hdu 5015
- 西安网络赛三道水题 HDU 5007 HDU 5011 HDU 5015
- hdu 5015 233 Matrix
- HDU 5015 233 Matrix
- hdu 5015 233 Matrix
- HDU - 5015 -233 Matrix
- hdu- 5015 233 Matrix
- HDU 5015解题报告
- HDU 5015 233 Matrix
- HDU 5015 233 Matrix
- hdu 5015 233 Matrix
- HDU 5015 233 Matrix
- HDU 5015 233 Matrix
- hdu
- hdu
- HDU
- hdu ()
- CSU C(1972): 大梵天的恩赐 -汉诺塔变形-双层汉诺塔
- JavaScript操作Url方法版
- 希尔排序
- fork的底层实现
- Python729
- hdu 5015
- PHP连接MySQL数据库的几种方式
- HDU 1503-Advanced Fruits(动态规划,LCS)
- 微信小程序——2.小程序搭建
- Minimum Path Sum问题及解法
- Python循环
- Java微信公众平台开发之消息管理
- SHUOJ好多鸡排
- Sring Data Redis 序言---笔记1