結果
問題 | No.500 階乗電卓 |
ユーザー | McGregorsh |
提出日時 | 2023-05-16 21:36:24 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,454 bytes |
コンパイル時間 | 419 ms |
コンパイル使用メモリ | 87,204 KB |
実行使用メモリ | 92,584 KB |
最終ジャッジ日時 | 2023-08-21 09:18:26 |
合計ジャッジ時間 | 7,095 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 244 ms
91,976 KB |
testcase_01 | AC | 245 ms
92,224 KB |
testcase_02 | AC | 239 ms
92,480 KB |
testcase_03 | AC | 240 ms
92,300 KB |
testcase_04 | AC | 241 ms
92,200 KB |
testcase_05 | AC | 239 ms
92,104 KB |
testcase_06 | AC | 241 ms
92,220 KB |
testcase_07 | AC | 244 ms
92,224 KB |
testcase_08 | AC | 243 ms
92,412 KB |
testcase_09 | AC | 244 ms
92,180 KB |
testcase_10 | AC | 241 ms
92,100 KB |
testcase_11 | AC | 244 ms
92,300 KB |
testcase_12 | AC | 243 ms
92,396 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 245 ms
92,328 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | AC | 251 ms
92,208 KB |
testcase_19 | AC | 252 ms
92,408 KB |
testcase_20 | AC | 251 ms
92,420 KB |
testcase_21 | AC | 248 ms
92,396 KB |
testcase_22 | AC | 251 ms
92,176 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): N = int(input()) if N >= 60: print('0' * 12) else: print(factorial(N) % (10**12)) if __name__ == '__main__': main()