結果

問題 No.1050 Zero (Maximum)
ユーザー hedwig100hedwig100
提出日時 2020-05-08 22:46:22
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 185 ms / 2,000 ms
コード長 1,786 bytes
コンパイル時間 208 ms
コンパイル使用メモリ 82,576 KB
実行使用メモリ 75,996 KB
最終ジャッジ日時 2024-07-04 01:03:20
合計ジャッジ時間 2,458 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 15
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

MOD = 10 **9 + 7
class Matrix(list):
def mul(self,B,mod = 0):
C = Matrix([[0] * len(B[0]) for _ in range(len(self))])
if mod == 0:
for i in range(len(self)):
for k in range(len(B)):
for j in range(len(B[0])):
C[i][j] += self[i][k] * B[k][j]
return C
else:
for i in range(len(self)):
for k in range(len(B)):
for j in range(len(B[0])):
C[i][j] = (C[i][j] + self[i][k] * B[k][j]) % mod
return C
def pow(self,n,mod = 0):
if len(self) != len(self[0]):
raise ValueError('the size of matrix is different')
if mod == 0:
B = Matrix([[0] * len(self) for _ in range(len(self))])
A = self
for i in range(len(self)):
B[i][i] = 1
while n > 0:
if (n&1):
B = B.mul(A)
A = A.mul(A)
n //= 2
return B
else:
B = Matrix([[0] * len(self) for _ in range(len(self))])
A = self
for i in range(len(self)):
B[i][i] = 1
while n > 0:
if (n&1):
B = B.mul(A,mod)
A = A.mul(A,mod)
n //= 2
return B
def main():
M,K = map(int,input().split())
A = [[1] * M for _ in range(M)]
for i in range(M):
for j in range(M):
x = i*j%M
A[M - x - 1][M - i - 1] += 1
A = Matrix(A)
B = A.pow(K,MOD)
ans = B[-1][-1]
print(ans)
if __name__ == '__main__':
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0