結果
問題 | No.554 recurrence formula |
ユーザー |
![]() |
提出日時 | 2017-08-11 23:35:05 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 28 ms / 2,000 ms |
コード長 | 2,118 bytes |
コンパイル時間 | 1,060 ms |
コンパイル使用メモリ | 111,504 KB |
実行使用メモリ | 18,060 KB |
最終ジャッジ日時 | 2024-10-12 22:03:50 |
合計ジャッジ時間 | 2,626 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 21 |
コンパイルメッセージ
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));}static class Extentions{public const int Mod = 1000000007;}static class Program{public static void Main(){var sw = new StreamWriter(OpenStandardOutput()) { NewLine = "\n" };#if DEBUGsw.AutoFlush = true;#elsesw.AutoFlush = false;#endifSetOut(sw);Solve(new IO());Out.Flush();}static void Solve(IO io){var n = io.L;var e = 0L;var o = 0L;var a = new long[n + 1];a[1] = 1L;for (var i = 2; i <= n; i++){if (i % 2 == 0) a[i] = i * (o += a[i - 1]);else a[i] = i * (e += a[i - 1]);a[i] %= Mod;}io.Write(a[n]);}}