結果

問題 No.1448 和差算
ユーザー 👑 SPD_9X2
提出日時 2021-03-31 14:33:30
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 44 ms / 2,000 ms
コード長 1,577 bytes
コンパイル時間 255 ms
コンパイル使用メモリ 82,024 KB
実行使用メモリ 54,348 KB
最終ジャッジ日時 2024-12-14 19:13:37
合計ジャッジ時間 2,830 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

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

"""
"""
import sys
from sys import stdin
#A,B(,mod0mod)
def matrix_mul(A,B,mod):
ans = [ [0] * len(B[0]) for i in range(len(A)) ]
for ai in range(len(A)):
for bj in range(len(B[0])):
now = 0
for same in range(len(A[0])):
now += A[ai][same] * B[same][bj]
if mod > 0:
ans[ai][bj] = now % mod
else:
ans[ai][bj] = now
return ans
#Ax()
def matrix_pow(A,x,mod):
B = [[A[i][j] for j in range(len(A[0]))] for i in range(len(A))]
ans = [[0] * len(A[0]) for i in range(len(A))]
for i in range(len(A)):
ans[i][i] = 1
while x > 0:
if x % 2 == 1:
ans = matrix_mul(ans,B,mod)
B = matrix_mul(B,B,mod)
x//=2
return ans
A,B,C,D = map(int,stdin.readline().split())
N = int(stdin.readline())
dp = [ [ [0,0] for j in range(2) ] for i in range(10)]
dp[0][0] = [1,0]
dp[0][1] = [0,1]
for i in range(8):
dp[i+1][0] = [dp[i][0][0] - dp[i][1][0] , dp[i][0][1] - dp[i][1][1]]
dp[i+1][1] = [dp[i][0][0] + dp[i][1][0] , dp[i][0][1] + dp[i][1][1]]
if dp[N % 8][0][0] + dp[N % 8][1][0] >= 0:
ak = B
else:
ak = A
if dp[N % 8][0][1] + dp[N % 8][1][1] >= 0:
bk = D
else:
bk = C
print (ak,bk,file=sys.stderr)
fi = [[ak,bk]]
mt = [ [1,1],[-1,1] ]
mod = 10**9+7
ans = matrix_mul(fi,matrix_pow(mt,N,mod),mod)
print (sum(ans[0]) % mod)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0