#P1933. Matrix Power Series

    ID: 952 传统题 文件IO:tk 3000ms 512MiB 尝试: 0 已通过: 0 难度: (无) 上传者: 标签>进阶指南0x3B 数学知识 总结与练习习题

Matrix Power Series

Time Limit: 3000MS Memory Limit: 131072K Total Submissions: 24399 Accepted: 10145 Description Given a n × n matrix A and a positive integer k, find the sum S = A + A2 + A3 + … + Ak. Input The input contains exactly one test case. The first line of input contains three positive integers n (n ≤ 30), k (k ≤ 109) and m (m < 104). Then follow n lines each containing n nonnegative integers below 32,768, giving A’s elements in row-major order. Output Output the elements of S modulo m in the same way as A is given. Sample Input 2 2 4 0 1 1 1 Sample Output 1 2 2 3 Source POJ Monthly--2007.06.03, Huang, Jinsong