結果
問題 | No.502 階乗を計算するだけ |
ユーザー | vwxyz |
提出日時 | 2022-05-01 23:47:42 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 320 ms / 1,000 ms |
コード長 | 1,840 bytes |
コンパイル時間 | 279 ms |
コンパイル使用メモリ | 86,856 KB |
実行使用メモリ | 91,896 KB |
最終ジャッジ日時 | 2023-09-13 16:46:57 |
合計ジャッジ時間 | 16,019 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 253 ms
91,204 KB |
testcase_01 | AC | 247 ms
90,848 KB |
testcase_02 | AC | 247 ms
91,072 KB |
testcase_03 | AC | 250 ms
90,844 KB |
testcase_04 | AC | 252 ms
91,112 KB |
testcase_05 | AC | 247 ms
91,104 KB |
testcase_06 | AC | 247 ms
91,108 KB |
testcase_07 | AC | 248 ms
91,128 KB |
testcase_08 | AC | 248 ms
91,084 KB |
testcase_09 | AC | 255 ms
90,848 KB |
testcase_10 | AC | 252 ms
91,220 KB |
testcase_11 | AC | 249 ms
91,016 KB |
testcase_12 | AC | 246 ms
90,956 KB |
testcase_13 | AC | 250 ms
90,720 KB |
testcase_14 | AC | 251 ms
91,160 KB |
testcase_15 | AC | 253 ms
90,956 KB |
testcase_16 | AC | 257 ms
91,056 KB |
testcase_17 | AC | 251 ms
91,100 KB |
testcase_18 | AC | 251 ms
90,840 KB |
testcase_19 | AC | 252 ms
90,964 KB |
testcase_20 | AC | 251 ms
91,148 KB |
testcase_21 | AC | 247 ms
90,728 KB |
testcase_22 | AC | 261 ms
91,764 KB |
testcase_23 | AC | 251 ms
91,840 KB |
testcase_24 | AC | 252 ms
91,876 KB |
testcase_25 | AC | 249 ms
91,744 KB |
testcase_26 | AC | 250 ms
91,844 KB |
testcase_27 | AC | 245 ms
91,884 KB |
testcase_28 | AC | 249 ms
91,588 KB |
testcase_29 | AC | 246 ms
91,892 KB |
testcase_30 | AC | 252 ms
91,752 KB |
testcase_31 | AC | 248 ms
91,712 KB |
testcase_32 | AC | 294 ms
91,812 KB |
testcase_33 | AC | 320 ms
91,648 KB |
testcase_34 | AC | 318 ms
91,836 KB |
testcase_35 | AC | 319 ms
91,812 KB |
testcase_36 | AC | 290 ms
91,896 KB |
testcase_37 | AC | 320 ms
91,740 KB |
testcase_38 | AC | 282 ms
91,740 KB |
testcase_39 | AC | 317 ms
91,784 KB |
testcase_40 | AC | 263 ms
91,860 KB |
testcase_41 | AC | 251 ms
91,096 KB |
testcase_42 | AC | 252 ms
91,156 KB |
testcase_43 | AC | 250 ms
91,100 KB |
testcase_44 | AC | 252 ms
91,188 KB |
testcase_45 | AC | 252 ms
91,244 KB |
testcase_46 | AC | 246 ms
91,240 KB |
testcase_47 | AC | 247 ms
91,312 KB |
testcase_48 | AC | 248 ms
91,220 KB |
testcase_49 | AC | 251 ms
91,164 KB |
testcase_50 | AC | 251 ms
91,180 KB |
testcase_51 | AC | 246 ms
91,104 KB |
ソースコード
import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines N=int(readline()) mod=10**9+7 if N>=10**9+7: ans=0 else: lst=[1,682498929,491101308,76479948,723816384,67347853,27368307,625544428,199888908,888050723,927880474,281863274,661224977,623534362,970055531,261384175,195888993,66404266,547665832,109838563,933245637,724691727,368925948,268838846,136026497,112390913,135498044,217544623,419363534,500780548,668123525,128487469,30977140,522049725,309058615,386027524,189239124,148528617,940567523,917084264,429277690,996164327,358655417,568392357,780072518,462639908,275105629,909210595,99199382,703397904,733333339,97830135,608823837,256141983,141827977,696628828,637939935,811575797,848924691,131772368,724464507,272814771,326159309,456152084,903466878,92255682,769795511,373745190,606241871,825871994,957939114,435887178,852304035,663307737,375297772,217598709,624148346,671734977,624500515,748510389,203191898,423951674,629786193,672850561,814362881,823845496,116667533,256473217,627655552,245795606,586445753,172114298,193781724,778983779,83868974,315103615,965785236,492741665,377329025,847549272,698611116] n=N//(10**7) ans=lst[n] for i in range(n*10**7+1,N+1): ans*=i ans%=mod print(ans)