結果
問題 | No.978 Fibonacci Convolution Easy |
ユーザー | fgwiebfaoish |
提出日時 | 2020-02-01 05:20:17 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 222 ms / 2,000 ms |
コード長 | 3,910 bytes |
コンパイル時間 | 1,085 ms |
コンパイル使用メモリ | 115,232 KB |
実行使用メモリ | 40,604 KB |
最終ジャッジ日時 | 2024-09-18 21:04:47 |
合計ジャッジ時間 | 4,051 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 29 ms
23,908 KB |
testcase_01 | AC | 102 ms
29,300 KB |
testcase_02 | AC | 65 ms
26,208 KB |
testcase_03 | AC | 211 ms
38,152 KB |
testcase_04 | AC | 75 ms
26,940 KB |
testcase_05 | AC | 38 ms
23,832 KB |
testcase_06 | AC | 94 ms
30,384 KB |
testcase_07 | AC | 149 ms
30,736 KB |
testcase_08 | AC | 110 ms
29,672 KB |
testcase_09 | AC | 166 ms
34,236 KB |
testcase_10 | AC | 222 ms
40,604 KB |
testcase_11 | AC | 82 ms
27,252 KB |
testcase_12 | AC | 38 ms
26,008 KB |
testcase_13 | AC | 92 ms
28,460 KB |
testcase_14 | AC | 46 ms
24,712 KB |
testcase_15 | AC | 103 ms
31,040 KB |
testcase_16 | AC | 220 ms
38,824 KB |
testcase_17 | AC | 219 ms
38,532 KB |
testcase_18 | AC | 27 ms
25,896 KB |
testcase_19 | AC | 26 ms
24,072 KB |
testcase_20 | AC | 26 ms
23,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.Collections; using System.Collections.Specialized; using System.Linq; using System.Text; using System.IO; using System.Reflection; using static System.Math; using System.Numerics; static class Program{ const int mod=(int)1e9+7; static void Main(){ Sc sc=new Sc(); var s=sc.Ia; if(s[0]==1){ Console.WriteLine(0); return; } var a=new Mint[s[0]]; a[1]=1; for(int i = 2;i<s[0];i++) {a[i]=a[i-1]*s[1]+a[i-2];} Mint p=0,ans=0; for(int i = s[0]-1;i>0;i--) { p+=a[i]; ans+=a[i]*p; } Console.WriteLine("{0}",ans); } } public struct Mint{ const int mod=(int)1e9+7; private long d; public Mint(long d){this.d=d;} public static implicit operator Mint(long d){return new Mint(d%mod);} public static explicit operator long(Mint d){return d.d;} public override string ToString(){return d.ToString();} public static Mint operator+(Mint a,long b){a.d=(a.d+b)%mod;return a;} public static Mint operator+(Mint a,Mint b){a.d=(a.d+b.d)%mod;return a;} public static Mint operator-(Mint a,long b){a.d=(mod+a.d-b)%mod;return a;} public static Mint operator-(Mint a,Mint b){a.d=(mod+a.d-b.d)%mod;return a;} public static Mint operator*(Mint a,long b){a.d=(a.d*b)%mod;return a;} public static Mint operator*(Mint a,Mint b){a.d=(a.d*b.d)%mod;return a;} public static Mint operator/(Mint a,long b){a.d=(a.d*Mi(b))%mod;return a;} public static Mint operator/(Mint a,Mint b){a.d=(a.d*Mi(b.d))%mod;return a;} private static long Mi(long a){ a=(a+mod)%mod; long b=mod,u=1,v=0; while(b>0){ long t=a/b; a-=t*b;a^=b;b^=a;a^=b; u-=t*v;u^=v;v^=u;u^=v; } u%=mod; if(u<0){u+=mod;} return u%mod; } } public class Sc{ public int I{get{return int.Parse(Console.ReadLine());}} public long L{get{return long.Parse(Console.ReadLine());}} public double D{get{return double.Parse(Console.ReadLine());}} public string S{get{return Console.ReadLine();}} public int[] Ia{get{return Array.ConvertAll(Console.ReadLine().Split(),int.Parse);}} public long[] La{get{return Array.ConvertAll(Console.ReadLine().Split(),long.Parse);}} public double[] Da{get{return Array.ConvertAll(Console.ReadLine().Split(),double.Parse);}} public string[] Sa{get{return Console.ReadLine().Split();}} public object[] Oa{get{return Console.ReadLine().Split();}} public int[] Ia2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),int.Parse);}} public int[] Ia3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),int.Parse);} public int[] Ia3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split(),int.Parse);} public long[] La2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),long.Parse);}} public long[] La3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),long.Parse);} public long[] La3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split(),long.Parse);} public double[] Da2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),double.Parse);}} public double[] Da3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),double.Parse);} public double[] Da3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split(),double.Parse);} public T[] Arr<T>(int n,Func<T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f();}return a;} public T[] Arr<T>(int n,Func<int,T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i);}return a;} public T[] Arr<T>(int n,Func<string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(Console.ReadLine().Split());}return a;} public T[] Arr<T>(int n,Func<int,string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i,Console.ReadLine().Split());}return a;} }