HDOJ 4965 Fast Matrix Calculation
来源:互联网 发布:ubuntu wps 编辑:程序博客网 时间:2024/05/20 21:21
(AB)^n=A*(BA)^(n-1)^B
Fast Matrix Calculation
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 576 Accepted Submission(s): 297
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
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
- 阿里巴巴离职DBA 35岁总结的职业生涯
- oracle基础
- Linux下的时间结构及函数
- Java String的经典问题
- jQuery购物篮增减
- HDOJ 4965 Fast Matrix Calculation
- Ubuntu软件安装与删除命令
- javaEE错误手记之 springmvc 插入数据时,无效的列类型。
- Eclipse快捷键
- Android TV 长按事件在input驱动中的拦截
- 访问网络的基本概念 && foundation框架中访问网络的基本流程
- 电热膜易容术野蛮人三一没日三一和
- static和extern 的区别
- PAT 1051. Pop Sequence