結果

問題 No.523 LED
ユーザー claw88claw88
提出日時 2017-06-02 22:47:03
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 390 ms / 2,000 ms
コード長 2,380 bytes
コンパイル時間 866 ms
コンパイル使用メモリ 107,648 KB
実行使用メモリ 97,280 KB
最終ジャッジ日時 2024-09-21 23:42:05
合計ジャッジ時間 4,373 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 25
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
プレゼンテーションモードにする

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>;
//using System.Numerics;
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 N = cin.Nextlong;
var A = new long[N + 1];
A[0] = 1;
A[1] = 1;
for (int i = 2; i <= N; i++)
{
A[i] = (((A[i - 1] * (2 * i - 1))% mod) * i)%mod;
}
WriteLine(A[N]);
}
long kai(long a, long p)
{
long j = 1;
for (int i = 1; i <= a; i++)
{
j = (j * i) % p;
}
return j;
}
//a^b(mod p) solution works in O(logb).
long Powmod(long a, long b, long p)
{
if (b == 0) return 1;
if (b % 2 == 0)
{
long d = Powmod(a, b / 2, p);
return d * d % p;
}
else
{
return a * Powmod(a, b - 1, p) % p;
}
}
}
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); } }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0