結果

問題 No.502 階乗を計算するだけ
ユーザー Kiri8128Kiri8128
提出日時 2020-09-15 00:54:18
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 2,132 bytes
コンパイル時間 1,724 ms
コンパイル使用メモリ 87,120 KB
実行使用メモリ 130,912 KB
最終ジャッジ日時 2023-09-04 00:54:26
合計ジャッジ時間 16,728 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 72 ms
71,272 KB
testcase_01 AC 70 ms
71,472 KB
testcase_02 AC 71 ms
71,552 KB
testcase_03 AC 71 ms
71,376 KB
testcase_04 AC 71 ms
71,496 KB
testcase_05 AC 71 ms
71,392 KB
testcase_06 AC 70 ms
71,736 KB
testcase_07 AC 70 ms
71,704 KB
testcase_08 AC 70 ms
71,172 KB
testcase_09 AC 70 ms
71,548 KB
testcase_10 AC 73 ms
71,524 KB
testcase_11 AC 73 ms
71,112 KB
testcase_12 AC 72 ms
71,372 KB
testcase_13 AC 70 ms
71,548 KB
testcase_14 AC 71 ms
71,308 KB
testcase_15 AC 71 ms
71,388 KB
testcase_16 AC 71 ms
71,316 KB
testcase_17 AC 71 ms
71,636 KB
testcase_18 AC 71 ms
71,552 KB
testcase_19 AC 73 ms
71,440 KB
testcase_20 AC 73 ms
71,168 KB
testcase_21 AC 72 ms
71,392 KB
testcase_22 AC 107 ms
77,936 KB
testcase_23 AC 92 ms
76,764 KB
testcase_24 AC 105 ms
77,928 KB
testcase_25 AC 92 ms
76,600 KB
testcase_26 AC 110 ms
77,880 KB
testcase_27 AC 99 ms
76,888 KB
testcase_28 AC 108 ms
77,856 KB
testcase_29 AC 96 ms
76,596 KB
testcase_30 AC 104 ms
77,756 KB
testcase_31 AC 104 ms
77,668 KB
testcase_32 TLE -
testcase_33 TLE -
testcase_34 TLE -
testcase_35 AC 591 ms
96,288 KB
testcase_36 TLE -
testcase_37 TLE -
testcase_38 TLE -
testcase_39 TLE -
testcase_40 AC 597 ms
96,428 KB
testcase_41 TLE -
testcase_42 AC 72 ms
71,284 KB
testcase_43 AC 71 ms
71,364 KB
testcase_44 AC 71 ms
71,448 KB
testcase_45 AC 70 ms
71,532 KB
testcase_46 AC 70 ms
71,552 KB
testcase_47 AC 68 ms
71,612 KB
testcase_48 AC 70 ms
71,480 KB
testcase_49 AC 70 ms
71,368 KB
testcase_50 AC 70 ms
71,372 KB
testcase_51 AC 71 ms
71,588 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

k = 72
kk = k // 4
K = 1<<k
nu = lambda L: int("".join([hex(K+a)[3:] for a in L[::-1]]), 16)
st = lambda n: hex(n)[2:]
li = lambda s, l, r: [int(a, 16) % P if len(a) else 0 for a in [s[-(i+1)*kk:-i*kk] for i in range(l, r)]]

def grow(d, v, h):
    h += [0] * d
    f = [(-1 if (i+d) % 2 else 1) * fainv[i] * fainv[d-i] % P * h[i] % P for i in range(d+1)]
    nuf = nu(f)
    a = d * inv[v] % P
    t = [1] * (3*d+3)
    for i in range(1, 3*d+3): t[i] = t[i-1] * (a - d + i - 1) % P
    ti = [1] * (3*d+3)
    ti[-1] = pow(t[-1], P-2, P)
    for i in range(1, 3*d+3)[::-1]: ti[i-1] = ti[i] * (a - d + i - 1) % P
    iv = [1] * (3*d+3)
    for i in range(1, 3*d+3):
        iv[i] = ti[i] * t[i-1] % P

    ###
    g = [inv[i] for i in range(1, 2*d+2)]
    fg = li(st(nuf * nu(g)), d, d * 2 + 1)
    for i in range(d):
        h[i+d+1] = fg[i] * fa[d+i+1] % P * fainv[i] % P

    ###
    g = [iv[i] for i in range(1, 2*d+2)]
    fg = li(st(nuf * nu(g)), d, d * 2 + 1)
    for i in range(d+1):
        h[i] = h[i] * (fg[i] * t[d+i+1] % P * ti[i] % P) % P

    ###
    g = [iv[i] for i in range(d+2, 3*d+3)]
    fg = li(st(nuf * nu(g)), d, d * 2 + 1)
    for i in range(d):
        h[i+d+1] = h[i+d+1] * (fg[i] * t[2*d+i+2] % P * ti[d+i+1] % P) % P

    return h

# Create a table of the factorial of the first v+2 multiples of v, i.e., [0!, v!, 2v!, ..., (v(v+1))!]
def create_table(v):
    s = 1
    X = [1, v+1]
    while s < v:
        X = grow(s, v, X)
        s *= 2

    table = [1]
    for x in X:
        table.append(table[-1] * x % P)
    return table

def fact(i, table):
    a = table[i//v]
    for j in range(i//v*v+1, i+1):
        a = a * j % P
    return a

P = 10**9+7
N = int(input())
if N >= P:
    print(0)
else:
    v = 1 << (N.bit_length() + 1) // 2
    fa = [1] * (2*v+2)
    fainv = [1] * (2*v+2)
    for i in range(2*v+1):
        fa[i+1] = fa[i] * (i+1) % P
    fainv[-1] = pow(fa[-1], P-2, P)
    for i in range(2*v+1)[::-1]:
        fainv[i] = fainv[i+1] * (i+1) % P
    inv = [0] * (2*v+2)
    for i in range(1, 2*v+2):
        inv[i] = fainv[i] * fa[i-1] % P

    T = create_table(v)
    print(fact(N, T))
0