HDOJ 4965 Fast Matrix Calculation
来源:互联网 发布:中华网络一条龙官方 编辑:程序博客网 时间:2024/06/05 21:01
Fast Matrix Calculation
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1113 Accepted Submission(s): 536
Problem Description
One day, Alice and Bob felt bored again, Bob knows Alice is a girl who loves math and is just learning something about matrix, so he decided to make a crazy problem for her.
Bob has a six-faced dice which has numbers 0, 1, 2, 3, 4 and 5 on each face. At first, he will choose a number N (4 <= N <= 1000), and for N times, he keeps throwing his dice for K times (2 <=K <= 6) and writes down its number on the top face to make an N*K matrix A, in which each element is not less than 0 and not greater than 5. Then he does similar thing again with a bit difference: he keeps throwing his dice for N times and each time repeat it for K times to write down a K*N matrix B, in which each element is not less than 0 and not greater than 5. With the two matrix A and B formed, Alice’s task is to perform the following 4-step calculation.
Step 1: Calculate a new N*N matrix C = A*B.
Step 2: Calculate M = C^(N*N).
Step 3: For each element x in M, calculate x % 6. All the remainders form a new matrix M’.
Step 4: Calculate the sum of all the elements in M’.
Bob just made this problem for kidding but he sees Alice taking it serious, so he also wonders what the answer is. And then Bob turn to you for help because he is not good at math.
Bob has a six-faced dice which has numbers 0, 1, 2, 3, 4 and 5 on each face. At first, he will choose a number N (4 <= N <= 1000), and for N times, he keeps throwing his dice for K times (2 <=K <= 6) and writes down its number on the top face to make an N*K matrix A, in which each element is not less than 0 and not greater than 5. Then he does similar thing again with a bit difference: he keeps throwing his dice for N times and each time repeat it for K times to write down a K*N matrix B, in which each element is not less than 0 and not greater than 5. With the two matrix A and B formed, Alice’s task is to perform the following 4-step calculation.
Step 1: Calculate a new N*N matrix C = A*B.
Step 2: Calculate M = C^(N*N).
Step 3: For each element x in M, calculate x % 6. All the remainders form a new matrix M’.
Step 4: Calculate the sum of all the elements in M’.
Bob just made this problem for kidding but he sees Alice taking it serious, so he also wonders what the answer is. And then Bob turn to you for help because he is not good at math.
Input
The input contains several test cases. Each test case starts with two integer N and K, indicating the numbers N and K described above. Then N lines follow, and each line has K integers between 0 and 5, representing matrix A. Then K lines follow, and each line has N integers between 0 and 5, representing matrix B.
The end of input is indicated by N = K = 0.
The end of input is indicated by N = K = 0.
Output
For each case, output the sum of all the elements in M’ in a line.
Sample Input
4 25 54 45 40 04 2 5 51 3 1 56 31 2 30 3 02 3 44 3 22 5 50 5 03 4 5 1 1 05 3 2 3 3 23 1 5 4 5 20 0
Sample Output
1456
Author
SYSU
Source
2014 Multi-University Training Contest 9
#include <cstdio>#include <cstring>const int N = 1001;struct matrix{int ary[N][N];int row, col;void init(int row, int col) {this->row = row;this->col = col;for (int i = 0; i < row; ++i)for (int j = 0; j < col; ++j)ary[i][j] = 0;}matrix(int row = N, int col = N) {init(row, col);}matrix operator=(const matrix & X) {row = X.row;col = X.col;for (int i = 0; i < row; ++i)for (int j = 0; j < col; ++j)ary[i][j] = X.ary[i][j];}};matrix t;const matrix operator*(const matrix & A, const matrix & B) {t.init(A.row, B.col);for (int i = 0; i < t.row; ++i)for (int j = 0; j < t.col; ++j) for (int k = 0; k < A.col; ++k)t.ary[i][j] = (t.ary[i][j] + A.ary[i][k] * B.ary[k][j]) % 6;return t;}matrix A, B, ans, tmp;int quick_pow(int n, int m) {A.init(n, m);B.init(m, n);ans.init(m, m);tmp.init(m, m);for (int i = 0; i < n; ++i)for (int j = 0; j < m; ++j)scanf("%d", &A.ary[i][j]);for (int i = 0; i < m; ++i)for (int j = 0; j < n; ++j)scanf("%d", &B.ary[i][j]);tmp = B * A;for (int i = 0; i < m; ++i)ans.ary[i][i] = 1;n = n * n - 1;while (n) {if (n & 1)ans = ans * tmp;n >>= 1;tmp = tmp * tmp;}ans = A * ans;ans = ans * B;int res = 0;for (int i = 0; i < ans.row; ++i)for (int j = 0; j < ans.col; ++j)res += ans.ary[i][j];return res;}int main() {int n, m;while (~scanf("%d%d", &n, &m), n && m)printf("%d\n", quick_pow(n, m));return 0;}
0 0
- HDOJ 4965 Fast Matrix Calculation
- HDOJ 4965 Fast Matrix Calculation
- HDOJ-4965-Fast Matrix Calculation 解题报告
- hdoj 4965 Fast Matrix Calculation(矩阵快速幂)
- hdu 4965 Fast Matrix Calculation
- hdu - 4965 Fast Matrix Calculation
- hdu 4965 Fast Matrix Calculation
- HDU 4965 Fast Matrix Calculation
- HDU - 4965 Fast Matrix Calculation
- HDU 4965 Fast Matrix Calculation
- HDU 4965 Fast Matrix Calculation
- hdu 4965 Fast Matrix Calculation 矩阵乘法
- HDU 4965 Fast Matrix Calculation 想法题
- HDU 4965 Fast Matrix Calculation 【矩阵】
- hdu 4965 Fast Matrix Calculation(数学)
- hdu 4965 Fast Matrix Calculation 矩阵
- Fast Matrix Calculation HDU
- Fast Matrix Calculation HDU
- C语言中的switch语句
- java__io__字符流
- leetcode--Merge Intervals
- MySQL学习1_Win7下安装MySQL5.6.26
- ZOJ 3362--Beer Problem【最大费用最大流 && 有值得注意的地方】
- HDOJ 4965 Fast Matrix Calculation
- C/C++堆栈详解
- C#中使用强制类型实现字符串和ASCII码之间的转换
- Tomcat虚拟目录配置和测试
- SQLAlchemy (三)---使用操作连接符
- 适配Tips
- MySQL查看所有可用的字符集
- httpclient处理跳转(301、302)
- poj1426