結果

問題 No.1879 How many matchings?
ユーザー mkawa2
提出日時 2022-03-18 22:54:11
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 1,433 bytes
コンパイル時間 161 ms
コンパイル使用メモリ 82,312 KB
実行使用メモリ 55,060 KB
最終ジャッジ日時 2024-10-03 07:55:45
合計ジャッジ時間 1,270 ms
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 8 WA * 7
権限があれば一括ダウンロードができます

ソースコード

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

import sys
# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353
def dot(aa, bb):
h = len(aa)
w = len(bb[0])
res = [[0]*w for _ in range(h)]
for i, row in enumerate(aa):
for j, col in enumerate(zip(*bb)):
v = 0
# for a, b in zip(row, col): v += a*b
# res[i][j] = v%md
for a, b in zip(row, col): v += a*b%md
res[i][j] = v%md
return res
def matpow(mat, e):
n = len(mat)
res = [[1 if i == j else 0 for j in range(n)] for i in range(n)]
while e:
if e & 1: res = dot(res, mat)
mat = dot(mat, mat)
e >>= 1
return res
n = II()
mat = [[0, 1],
[1, 1]]
mat = matpow(mat, n//2)
ans = (mat[0][0]+mat[1][0])%md
if n & 1: ans = ans*n%md
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0