結果
問題 | No.502 階乗を計算するだけ |
ユーザー | claw88 |
提出日時 | 2017-04-07 23:25:18 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,000 bytes |
コンパイル時間 | 976 ms |
コンパイル使用メモリ | 112,020 KB |
実行使用メモリ | 152,888 KB |
最終ジャッジ日時 | 2024-07-16 03:05:25 |
合計ジャッジ時間 | 5,437 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 29 ms
35,492 KB |
testcase_01 | AC | 28 ms
28,172 KB |
testcase_02 | AC | 28 ms
28,188 KB |
testcase_03 | AC | 26 ms
26,308 KB |
testcase_04 | AC | 26 ms
26,284 KB |
testcase_05 | AC | 25 ms
25,908 KB |
testcase_06 | AC | 26 ms
23,992 KB |
testcase_07 | AC | 27 ms
25,792 KB |
testcase_08 | AC | 27 ms
25,920 KB |
testcase_09 | AC | 27 ms
28,172 KB |
testcase_10 | AC | 25 ms
28,092 KB |
testcase_11 | AC | 26 ms
27,832 KB |
testcase_12 | AC | 25 ms
25,900 KB |
testcase_13 | AC | 26 ms
28,056 KB |
testcase_14 | AC | 25 ms
26,032 KB |
testcase_15 | AC | 26 ms
23,868 KB |
testcase_16 | AC | 26 ms
26,176 KB |
testcase_17 | AC | 27 ms
26,040 KB |
testcase_18 | AC | 26 ms
25,900 KB |
testcase_19 | AC | 26 ms
26,048 KB |
testcase_20 | AC | 27 ms
27,816 KB |
testcase_21 | AC | 28 ms
23,988 KB |
testcase_22 | AC | 145 ms
40,292 KB |
testcase_23 | AC | 56 ms
29,248 KB |
testcase_24 | AC | 98 ms
35,052 KB |
testcase_25 | AC | 35 ms
26,428 KB |
testcase_26 | AC | 67 ms
32,796 KB |
testcase_27 | AC | 52 ms
28,476 KB |
testcase_28 | AC | 59 ms
29,628 KB |
testcase_29 | AC | 40 ms
27,328 KB |
testcase_30 | AC | 130 ms
41,004 KB |
testcase_31 | AC | 77 ms
33,892 KB |
testcase_32 | TLE | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
testcase_41 | -- | - |
testcase_42 | -- | - |
testcase_43 | -- | - |
testcase_44 | -- | - |
testcase_45 | -- | - |
testcase_46 | -- | - |
testcase_47 | -- | - |
testcase_48 | -- | - |
testcase_49 | -- | - |
testcase_50 | -- | - |
testcase_51 | -- | - |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Collections.Generic; using System.Linq; using System.IO; using System.Globalization; using System.Diagnostics; using static System.Console; using Pair = System.Collections.Generic.KeyValuePair<int, int>; class Program { static void Main() { //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false }); new Program().Solve(); Out.Flush(); } Scanner cin = new Scanner(); Random rnd = new Random(); Stopwatch sw = new Stopwatch(); readonly int[] dd = { 0, 1, 0, -1, 0 }; readonly int mod = 1000000007; readonly string alfa = "abcdefghijklmnopqrstuvwxyz"; void Solve() { long d = cin.Nextlong; if (d >= mod) WriteLine(0); else WriteLine(Factorial(d % mod)); } long Factorial(long n) { if (n == 0) return 1; long d = Factorial(n / 2); d = d * d % mod; d = d * Combination(n, n / 2) % mod; if (n % 2 == 0) return d; else return d * (n - n / 2) % mod; } long Combination(long n, long r) { if (n < 0 || r < 0 || r > n) throw new ArgumentException("不正な引数です."); if (n - r < r) r = n - r; if (r == 0) return 1; if (r == 1) return n; var numerator = new long[r]; var denominator = new long[r]; for (int k = 0; k < r; k++) { numerator[k] = n - r + k + 1; denominator[k] = k + 1; } for (int p = 2; p <= r; p++) { long pivot = denominator[p - 1]; if (pivot > 1) { long offset = (n - r) % p; for (int k = p - 1; k < r; k += p) { numerator[k - offset] /= pivot; denominator[k] /= pivot; } } } long result = 1; for (int k = 0; k < r; k++) { if (numerator[k] > 1) result = result * numerator[k] % mod; } return result; } } class Scanner { string[] s; int i; char[] cs = new char[] { ' ' }; public Scanner() { s = new string[0]; i = 0; } public string[] Scan { get { return ReadLine().Split(); } } public int[] Scanint { get { return Array.ConvertAll(Scan, int.Parse); } } public long[] Scanlong { get { return Array.ConvertAll(Scan, long.Parse); } } public double[] Scandouble { get { return Array.ConvertAll(Scan, double.Parse); } } public string Next { get { if (i < s.Length) return s[i++]; string st = ReadLine(); while (st == "") st = ReadLine(); s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries); i = 0; return Next; } } public int Nextint { get { return int.Parse(Next); } } public long Nextlong { get { return long.Parse(Next); } } public double Nextdouble { get { return double.Parse(Next); } } }