結果
問題 | No.657 テトラナッチ数列 Easy |
ユーザー | くれちー |
提出日時 | 2018-03-02 22:25:30 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 80 ms / 2,000 ms |
コード長 | 10,553 bytes |
コンパイル時間 | 1,628 ms |
コンパイル使用メモリ | 119,312 KB |
実行使用メモリ | 33,016 KB |
最終ジャッジ日時 | 2024-06-13 03:19:08 |
合計ジャッジ時間 | 3,341 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 67 ms
30,956 KB |
testcase_01 | AC | 67 ms
33,016 KB |
testcase_02 | AC | 67 ms
32,892 KB |
testcase_03 | AC | 67 ms
33,008 KB |
testcase_04 | AC | 68 ms
30,708 KB |
testcase_05 | AC | 72 ms
30,788 KB |
testcase_06 | AC | 66 ms
28,772 KB |
testcase_07 | AC | 66 ms
32,836 KB |
testcase_08 | AC | 67 ms
30,820 KB |
testcase_09 | AC | 74 ms
30,756 KB |
testcase_10 | AC | 76 ms
30,956 KB |
testcase_11 | AC | 77 ms
30,820 KB |
testcase_12 | AC | 79 ms
30,580 KB |
testcase_13 | AC | 80 ms
30,700 KB |
testcase_14 | AC | 80 ms
32,748 KB |
testcase_15 | AC | 79 ms
28,792 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;using System.Collections.Generic;using System.Diagnostics;using System.IO;using System.Linq;using System.Numerics;using System.Text;using static System.Convert;using static System.Math;using static Constants;using static Extensions;using static MathExtensions;public static class Program{public static void Solve(){var q = I;var seq = new ModInt32[1000001];seq[0] = seq[1] = seq[2] = 0;seq[3] = 1;foreach (var i in Range(4, 1000001))seq[i] = seq[i - 1] + seq[i - 2] + seq[i - 3] + seq[i - 4];foreach (var i in Range(q)){var n = I;Console.WriteLine(seq[n - 1]);}}#region Scannersstatic TextScanner _ts;static char C => char.Parse(_ts.Next());static string S => _ts.Next();static int I => int.Parse(_ts.Next());static long L => long.Parse(_ts.Next());static BigInteger B => BigInteger.Parse(_ts.Next());static double D => double.Parse(_ts.Next());static decimal M => decimal.Parse(_ts.Next());#endregionpublic static void Main(){var sw = new StreamWriter(Console.OpenStandardOutput());sw.NewLine = "\n";#if DEBUGsw.AutoFlush = true;#elsesw.AutoFlush = false;#endifConsole.SetOut(sw);_ts = new TextScanner(Console.In);Solve();Console.Out.Flush();}}public static partial class Extensions{}#pragma warning disable#region Librarypublic struct ModInt32 : IEquatable<ModInt32>{private long _value;public const int Mod = 17;public static readonly ModInt32 Zero = new ModInt32(0);public static readonly ModInt32 One = new ModInt32(1);public ModInt32(long value) { _value = value % Mod; }private ModInt32(int value) { _value = value; }public int Value => (int)_value;public ModInt32 Invert() => ModPow(this, Mod - 2); // Mod must be primepublic static ModInt32 operator -(ModInt32 value){value._value = Mod - value._value;return value;}public static ModInt32 operator +(ModInt32 left, ModInt32 right){left._value += right._value;if (left._value >= Mod) left._value -= Mod;return left;}public static ModInt32 operator -(ModInt32 left, ModInt32 right){left._value -= right._value;if (left._value < 0) left._value += Mod;return left;}public static ModInt32 operator *(ModInt32 left, ModInt32 right){left._value = left._value * right._value % Mod;return left;}public static ModInt32 operator /(ModInt32 left, ModInt32 right) => left * right.Invert();public static ModInt32 operator ++(ModInt32 value){if (value._value == Mod - 1) value._value = 0;else value._value++;return value;}public static ModInt32 operator --(ModInt32 value){if (value._value == 0) value._value = Mod - 1;else value._value--;return value;}public static bool operator ==(ModInt32 left, ModInt32 right) => left.Equals(right);public static bool operator !=(ModInt32 left, ModInt32 right) => !left.Equals(right);public static implicit operator ModInt32(int value) => new ModInt32(value);public static implicit operator ModInt32(long value) => new ModInt32(value);public static ModInt32 ModPow(ModInt32 value, long exponent){var r = new ModInt32(1);for (; exponent > 0; value *= value, exponent >>= 1)if ((exponent & 1) == 1) r *= value;return r;}public static ModInt32 ModFact(int value){var r = new ModInt32(1);for (var i = 2; i <= value; i++) r *= value;return r;}public bool Equals(ModInt32 other) => _value == other._value;public override bool Equals(object obj){if (obj == null) return false;return this.Equals((ModInt32)obj);}public override int GetHashCode() => _value.GetHashCode();public override string ToString() => _value.ToString();}public class TextScanner{private readonly TextReader _tr;public TextScanner(TextReader tr){_tr = tr;}public string Next(){var sb = new StringBuilder();int i;do{i = _tr.Read();if (i == -1) throw new EndOfStreamException();}while (char.IsWhiteSpace((char)i));while (i != -1 && !char.IsWhiteSpace((char)i)){sb.Append((char)i);i = _tr.Read();}return sb.ToString();}}public static class Constants{public const int AnswerToLifeTheUniverseAndEverything = 42;public const string Yes = "Yes";public const string No = "No";public const string YES = "YES";public const string NO = "NO";public const string Possible = "Possible";public const string Impossible = "Impossible";public const string POSSIBLE = "POSSIBLE";public const string IMPOSSIBLE = "IMPOSSIBLE";}[DebuggerStepThrough]public static partial class Extensions{public static void Answer(object value){Console.WriteLine(value);Exit(0);}public static void Assert(bool condition){if (!condition) throw new Exception("Assertion failed");}public static string AsString(this IEnumerable<char> source) => new string(source.ToArray());public static Dictionary<T, int> Bucket<T>(this IEnumerable<T> source) where T : IEquatable<T>{var dict = new Dictionary<T, int>();foreach (var item in source) if (dict.ContainsKey(item)) dict[item]++; else dict[item] = 1;return dict;}public static int[] Bucket<T>(this IEnumerable<T> source, int maxValue, Func<T, int> selector){var arr = new int[maxValue + 1];foreach (var item in source) arr[selector(item)]++;return arr;}public static IComparer<T> CreateDescendingComparer<T>()where T : IComparable<T>=> Comparer<T>.Create((x, y) => y.CompareTo(x));public static IEnumerable<int> CumSum(this IEnumerable<int> source){var sum = 0;foreach (var item in source) yield return sum += item;}public static IEnumerable<long> CumSum(this IEnumerable<long> source){var sum = 0L;foreach (var item in source) yield return sum += item;}public static void Exit(int exitCode){Console.Out.Flush();Environment.Exit(exitCode);}public static void ForEach<T>(this IEnumerable<T> source, Action<T> action){foreach (var item in source) action(item);}public static void ForEach<T, _>(this IEnumerable<T> source, Func<T, _> func){foreach (var item in source) func(item);}public static void ForEach<T>(this IEnumerable<T> source, Action<T, int> action){var i = 0;foreach (var item in source) action(item, i++);}public static void ForEach<T, _>(this IEnumerable<T> source, Func<T, int, _> func){var i = 0;foreach (var item in source) func(item, i++);}// [l, r)public static bool IsIn<T>(this T value, T l, T r)where T : IComparable<T>{if (l.CompareTo(r) > 0) throw new ArgumentException();return l.CompareTo(value) <= 0 && value.CompareTo(r) < 0;}public static IEnumerable<int> Range(int start, int end, int step = 1){for (var i = start; i < end; i += step) yield return i;}public static IEnumerable<int> Range(int end) => Range(0, end);public static void Repeat(int count, Action action){for (var i = 0; i < count; i++) action();}public static void Repeat(int count, Action<int> action){for (var i = 0; i < count; i++) action(i);}public static IEnumerable<T> Repeat<T>(int count, Func<T> func){for (var i = 0; i < count; i++) yield return func();}public static IEnumerable<T> Repeat<T>(int count, Func<int, T> func){for (var i = 0; i < count; i++) yield return func(i);}public static void Swap<T>(ref T x, ref T y){var tmp = x; x = y; y = tmp;}}[DebuggerStepThrough]public static class MathExtensions{public static int DivCeil(int left, int right)=> left / right + (left % right == 0 ? 0 : 1);public static long DivCeil(long left, long right)=> left / right + (left % right == 0L ? 0L : 1L);public static int Gcd(int left, int right){int r;while ((r = left % right) != 0) { left = right; right = r; }return right;}public static long Gcd(long left, long right){long r;while ((r = left % right) != 0L) { left = right; right = r; }return right;}public static BigInteger Gcd(BigInteger left, BigInteger right)=> BigInteger.GreatestCommonDivisor(left, right);public static int HighestOneBit(int x){x |= x >> 01;x |= x >> 02;x |= x >> 04;x |= x >> 08;x |= x >> 16;return x - (x >> 1);}public static long HighestOneBit(long x){x |= x >> 01;x |= x >> 02;x |= x >> 04;x |= x >> 08;x |= x >> 16;x |= x >> 32;return x - (x >> 1);}public static int Lcm(int left, int right) => left / Gcd(left, right) * right;public static long Lcm(long left, long right) => left / Gcd(left, right) * right;public static BigInteger Lcm(BigInteger left, BigInteger right)=> left / Gcd(left, right) * right;public static int Pow(int value, int exponent){var r = 1;while (exponent > 0){if ((exponent & 1) == 1) r *= value;value *= value;exponent >>= 1;}return r;}public static long Pow(long value, int exponent){var r = 1L;while (exponent > 0){if ((exponent & 1) == 1) r *= value;value *= value;exponent >>= 1;}return r;}public static long Fact(int value){var r = 1L;for (var i = 2; i <= value; i++) r *= i;return r;}}#endregion