結果
問題 | No.502 階乗を計算するだけ |
ユーザー | zimpha |
提出日時 | 2017-04-08 02:40:15 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 228 ms / 1,000 ms |
コード長 | 4,756 bytes |
コンパイル時間 | 5,409 ms |
コンパイル使用メモリ | 74,064 KB |
実行使用メモリ | 51,184 KB |
最終ジャッジ日時 | 2023-09-23 03:36:48 |
合計ジャッジ時間 | 7,571 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
49,944 KB |
testcase_01 | AC | 45 ms
49,404 KB |
testcase_02 | AC | 45 ms
49,472 KB |
testcase_03 | AC | 44 ms
49,344 KB |
testcase_04 | AC | 46 ms
49,712 KB |
testcase_05 | AC | 45 ms
49,368 KB |
testcase_06 | AC | 45 ms
49,328 KB |
testcase_07 | AC | 45 ms
49,524 KB |
testcase_08 | AC | 44 ms
49,460 KB |
testcase_09 | AC | 44 ms
49,336 KB |
testcase_10 | AC | 44 ms
49,464 KB |
testcase_11 | AC | 44 ms
49,392 KB |
testcase_12 | AC | 45 ms
49,328 KB |
testcase_13 | AC | 46 ms
49,344 KB |
testcase_14 | AC | 46 ms
49,412 KB |
testcase_15 | AC | 46 ms
49,432 KB |
testcase_16 | AC | 46 ms
49,388 KB |
testcase_17 | AC | 44 ms
49,520 KB |
testcase_18 | AC | 44 ms
49,388 KB |
testcase_19 | AC | 45 ms
49,304 KB |
testcase_20 | AC | 46 ms
49,696 KB |
testcase_21 | AC | 45 ms
49,324 KB |
testcase_22 | AC | 68 ms
50,696 KB |
testcase_23 | AC | 55 ms
50,660 KB |
testcase_24 | AC | 62 ms
50,684 KB |
testcase_25 | AC | 48 ms
49,948 KB |
testcase_26 | AC | 56 ms
49,884 KB |
testcase_27 | AC | 54 ms
50,544 KB |
testcase_28 | AC | 55 ms
48,692 KB |
testcase_29 | AC | 51 ms
49,336 KB |
testcase_30 | AC | 66 ms
49,972 KB |
testcase_31 | AC | 58 ms
51,184 KB |
testcase_32 | AC | 158 ms
50,788 KB |
testcase_33 | AC | 228 ms
49,792 KB |
testcase_34 | AC | 215 ms
49,776 KB |
testcase_35 | AC | 227 ms
50,556 KB |
testcase_36 | AC | 141 ms
50,784 KB |
testcase_37 | AC | 227 ms
49,780 KB |
testcase_38 | AC | 126 ms
50,776 KB |
testcase_39 | AC | 205 ms
49,848 KB |
testcase_40 | AC | 77 ms
49,156 KB |
testcase_41 | AC | 44 ms
49,384 KB |
testcase_42 | AC | 45 ms
49,340 KB |
testcase_43 | AC | 46 ms
49,648 KB |
testcase_44 | AC | 45 ms
49,324 KB |
testcase_45 | AC | 45 ms
49,520 KB |
testcase_46 | AC | 45 ms
49,336 KB |
testcase_47 | AC | 45 ms
49,480 KB |
testcase_48 | AC | 45 ms
49,776 KB |
testcase_49 | AC | 45 ms
49,300 KB |
testcase_50 | AC | 45 ms
49,260 KB |
testcase_51 | AC | 46 ms
49,516 KB |
ソースコード
import java.io.OutputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.StringTokenizer; import java.io.IOException; import java.io.BufferedReader; import java.io.InputStreamReader; import java.io.InputStream; /** * Built using CHelper plug-in * Actual solution is at the top * * @author Chiaki.Hoshinomori */ public class Main { public static void main(String[] args) { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); Task502 solver = new Task502(); solver.solve(1, in, out); out.close(); } static class Task502 { int[] fact = new int[]{ 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, }; public void solve(int testNumber, InputReader in, PrintWriter out) { long n = in.nextLong(); long mod = 1000000000 + 7; if (n >= mod) { out.println(0); } else { long r = fact[(int) (n / 10000000)]; for (long i = n / 10000000 * 10000000 + 1; i <= n; ++i) { r = r * i % mod; } out.println(r); } } } static class InputReader { public BufferedReader reader; public StringTokenizer tokenizer; public InputReader(InputStream stream) { reader = new BufferedReader(new InputStreamReader(stream), 32768); tokenizer = null; } public String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public long nextLong() { return Long.parseLong(next()); } } }