結果
問題 | No.573 a^2[i] = a[i] |
ユーザー | くれちー |
提出日時 | 2017-10-06 23:25:53 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 72 ms / 2,000 ms |
コード長 | 2,905 bytes |
コンパイル時間 | 940 ms |
コンパイル使用メモリ | 119,608 KB |
実行使用メモリ | 28,136 KB |
最終ジャッジ日時 | 2024-04-28 10:52:07 |
合計ジャッジ時間 | 3,179 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 26 ms
25,836 KB |
testcase_01 | AC | 23 ms
22,064 KB |
testcase_02 | AC | 23 ms
23,852 KB |
testcase_03 | AC | 23 ms
23,788 KB |
testcase_04 | AC | 23 ms
26,220 KB |
testcase_05 | AC | 24 ms
23,916 KB |
testcase_06 | AC | 23 ms
23,920 KB |
testcase_07 | AC | 24 ms
28,136 KB |
testcase_08 | AC | 25 ms
26,096 KB |
testcase_09 | AC | 26 ms
25,840 KB |
testcase_10 | AC | 25 ms
23,860 KB |
testcase_11 | AC | 25 ms
23,860 KB |
testcase_12 | AC | 25 ms
25,840 KB |
testcase_13 | AC | 25 ms
24,172 KB |
testcase_14 | AC | 23 ms
25,956 KB |
testcase_15 | AC | 23 ms
21,936 KB |
testcase_16 | AC | 23 ms
25,828 KB |
testcase_17 | AC | 22 ms
23,724 KB |
testcase_18 | AC | 23 ms
23,908 KB |
testcase_19 | AC | 24 ms
21,692 KB |
testcase_20 | AC | 24 ms
23,916 KB |
testcase_21 | AC | 26 ms
21,816 KB |
testcase_22 | AC | 25 ms
23,916 KB |
testcase_23 | AC | 24 ms
23,924 KB |
testcase_24 | AC | 24 ms
25,952 KB |
testcase_25 | AC | 23 ms
24,176 KB |
testcase_26 | AC | 23 ms
23,912 KB |
testcase_27 | AC | 23 ms
24,108 KB |
testcase_28 | AC | 22 ms
26,096 KB |
testcase_29 | AC | 24 ms
21,684 KB |
testcase_30 | AC | 23 ms
23,916 KB |
testcase_31 | AC | 23 ms
23,856 KB |
testcase_32 | AC | 26 ms
25,960 KB |
testcase_33 | AC | 25 ms
25,968 KB |
testcase_34 | AC | 26 ms
25,960 KB |
testcase_35 | AC | 26 ms
23,924 KB |
testcase_36 | AC | 24 ms
24,044 KB |
testcase_37 | AC | 25 ms
23,852 KB |
testcase_38 | AC | 24 ms
23,952 KB |
testcase_39 | AC | 25 ms
23,920 KB |
testcase_40 | AC | 24 ms
23,828 KB |
testcase_41 | AC | 24 ms
23,852 KB |
testcase_42 | AC | 26 ms
24,172 KB |
testcase_43 | AC | 26 ms
23,852 KB |
testcase_44 | AC | 28 ms
23,888 KB |
testcase_45 | AC | 29 ms
24,148 KB |
testcase_46 | AC | 72 ms
24,728 KB |
コンパイルメッセージ
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.IO; using System.Linq; using System.Numerics; using System.Text; using static System.Console; using static System.Convert; using static System.Math; using static Extentions; class IO { int idx; string[] input = In.ReadToEnd().Split(new[] { " ", "\n", "\r" }, StringSplitOptions.RemoveEmptyEntries); T Get<T>(Func<string, T> parser) => parser(input[idx++]); public string S => Get(s => s); public char C => Get(char.Parse); public int I => Get(int.Parse); public long L => Get(long.Parse); public double F => Get(double.Parse); public decimal D => Get(decimal.Parse); public BigInteger B => Get(BigInteger.Parse); T[] Gets<T>(int n, Func<string, T> parser) => input.Skip((idx += n) - n).Take(n).Select(parser).ToArray(); public string[] Ss(int n) => Gets(n, s => s); public char[] Cs(int n) => Gets(n, char.Parse); public int[] Is(int n) => Gets(n, int.Parse); public long[] Ls(int n) => Gets(n, long.Parse); public double[] Fs(int n) => Gets(n, double.Parse); public decimal[] Ds(int n) => Gets(n, decimal.Parse); public BigInteger[] Bs(int n) => Gets(n, BigInteger.Parse); public void Write<T>(params T[] xs) => WriteLine(string.Join(" ", xs)); public void Write(params object[] xs) => WriteLine(string.Join(" ", xs)); } class Combination { private long[] fact, revFact; public Combination(int n) { fact = new long[n]; revFact = new long[n]; fact[0] = 1; for (var i = 1; i < n; i++) { fact[i] = fact[i - 1] * i; fact[i] %= Mod; } revFact[n - 1] = ModPow(fact[n - 1], Mod - 2); for (var i = n - 2; i >= 0; i--) { revFact[i] = revFact[i + 1] * (i + 1); revFact[i] %= Mod; } } public long this[int n, int r] => (((fact[n] * revFact[r]) % Mod) * revFact[n - r]) % Mod; } static class Extentions { public const int Mod = 1000000007; public static long ModPow(long x, long n) { var a = 1L; while (n > 0) { x %= Mod; a %= Mod; if ((n & 1) == 1) a *= x; x *= x; n >>= 1; } return a % Mod; } } static class Program { public static void Main() { var sw = new StreamWriter(OpenStandardOutput()) { NewLine = "\n" }; #if DEBUG sw.AutoFlush = true; #else sw.AutoFlush = false; #endif SetOut(sw); Solve(new IO()); Out.Flush(); } static void Solve(IO io) { var n = io.I; var ans = 0L; var comb = new Combination(n + 1); for (var i = 1; i <= n; i++) { ans += (comb[n, i] * ModPow(i, n - i)) % Mod; ans %= Mod; } io.Write(ans); } }