結果
問題 | No.1035 Color Box |
ユーザー | tonnnura172 |
提出日時 | 2020-04-26 01:13:56 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 347 ms / 2,000 ms |
コード長 | 1,187 bytes |
コンパイル時間 | 299 ms |
コンパイル使用メモリ | 12,928 KB |
実行使用メモリ | 19,200 KB |
最終ジャッジ日時 | 2024-04-25 21:45:21 |
合計ジャッジ時間 | 6,889 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 344 ms
19,072 KB |
testcase_01 | AC | 99 ms
19,072 KB |
testcase_02 | AC | 101 ms
19,072 KB |
testcase_03 | AC | 117 ms
19,072 KB |
testcase_04 | AC | 122 ms
19,072 KB |
testcase_05 | AC | 112 ms
19,200 KB |
testcase_06 | AC | 99 ms
19,072 KB |
testcase_07 | AC | 102 ms
19,072 KB |
testcase_08 | AC | 316 ms
19,200 KB |
testcase_09 | AC | 188 ms
19,072 KB |
testcase_10 | AC | 99 ms
19,072 KB |
testcase_11 | AC | 96 ms
19,072 KB |
testcase_12 | AC | 97 ms
19,072 KB |
testcase_13 | AC | 279 ms
19,200 KB |
testcase_14 | AC | 308 ms
19,072 KB |
testcase_15 | AC | 347 ms
19,072 KB |
testcase_16 | AC | 103 ms
19,072 KB |
testcase_17 | AC | 104 ms
19,200 KB |
testcase_18 | AC | 104 ms
19,072 KB |
testcase_19 | AC | 338 ms
19,072 KB |
testcase_20 | AC | 99 ms
19,072 KB |
testcase_21 | AC | 97 ms
19,072 KB |
testcase_22 | AC | 97 ms
19,072 KB |
testcase_23 | AC | 101 ms
19,072 KB |
testcase_24 | AC | 100 ms
19,072 KB |
testcase_25 | AC | 105 ms
19,072 KB |
testcase_26 | AC | 99 ms
19,072 KB |
testcase_27 | AC | 102 ms
19,072 KB |
testcase_28 | AC | 99 ms
19,072 KB |
testcase_29 | AC | 97 ms
19,072 KB |
testcase_30 | AC | 99 ms
19,072 KB |
testcase_31 | AC | 101 ms
19,072 KB |
testcase_32 | AC | 100 ms
19,072 KB |
testcase_33 | AC | 102 ms
19,200 KB |
testcase_34 | AC | 97 ms
19,072 KB |
testcase_35 | AC | 98 ms
19,072 KB |
testcase_36 | AC | 100 ms
19,072 KB |
testcase_37 | AC | 99 ms
19,200 KB |
ソースコード
import sys, re from collections import deque, defaultdict, Counter from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd from itertools import accumulate, permutations, combinations, product from operator import itemgetter, mul, add from copy import deepcopy from string import ascii_lowercase, ascii_uppercase, digits from bisect import bisect, bisect_left from heapq import heappush, heappop from functools import reduce, lru_cache def input(): return sys.stdin.readline().strip() def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(): return list(map(int, input().split())) def ZIP(n): return zip(*(MAP() for _ in range(n))) sys.setrecursionlimit(10 ** 9) INF = float('inf') mod = 10 ** 9 + 7 N, M = MAP() lim = 10**5+1 fact = [1] * (lim+1) fact_inv = [1] * (lim+1) for n in range(1, lim+1): fact[n] = (fact[n-1] * n) % mod fact_inv[lim] = pow(fact[lim], mod-2, mod) for n in range(lim, 0, -1): fact_inv[n-1] = (n * fact_inv[n]) % mod def C(n, r): return (((fact[n] * fact_inv[r]) % mod) * fact_inv[n-r]) % mod ans = pow(M, N, mod) tmp = 0 for i in range(1, M): tmp = C(M, i)*pow(i, N, mod)-tmp print((ans-tmp)%mod)