結果
問題 | No.1073 無限すごろく |
ユーザー |
|
提出日時 | 2020-10-11 05:47:54 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,167 bytes |
コンパイル時間 | 552 ms |
コンパイル使用メモリ | 68,344 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-20 17:06:29 |
合計ジャッジ時間 | 1,779 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
コンパイルメッセージ
a.cpp:7:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
ソースコード
#line 1 "a.cpp"#include<iostream>using namespace std;#line 3 "/home/kotatsugame/library/math/modint.cpp"#include<utility>template<int m>struct modint{unsigned int x;constexpr modint()noexcept:x(){}template<typename T>constexpr modint(T _x)noexcept:x((_x%=m)<0?_x+m:_x){}constexpr unsigned int val()const noexcept{return x;}constexpr modint&operator++()noexcept{if(++x==m)x=0;return*this;}constexpr modint&operator--()noexcept{if(x==0)x=m;--x;return*this;}constexpr modint operator++(int)noexcept{modint res=*this;++*this;return res;}constexpr modint operator--(int)noexcept{modint res=*this;--*this;return res;}constexpr modint&operator+=(const modint&a)noexcept{x+=a.x;if(x>=m)x-=m;return*this;}constexpr modint&operator-=(const modint&a)noexcept{if(x<a.x)x+=m;x-=a.x;return*this;}constexpr modint&operator*=(const modint&a)noexcept{x=(unsigned long long)x*a.x%m;return*this;}constexpr modint&operator/=(const modint&a)noexcept{return*this*=a.inv();}constexpr modint operator+()const noexcept{return*this;}constexpr modint operator-()const noexcept{return modint()-*this;}constexpr modint pow(long long n)const noexcept{if(n<0)return pow(-n).inv();modint x=*this,r=1;for(;n;x*=x,n>>=1)if(n&1)r*=x;return r;}constexpr modint inv()const noexcept{int s=x,t=m,x=1,u=0;while(t){int k=s/t;s-=k*t;swap(s,t);x-=k*u;swap(x,u);}return modint(x);}friend constexpr modint operator+(const modint&a,const modint&b){return modint(a)+=b;}friend constexpr modint operator-(const modint&a,const modint&b){return modint(a)-=b;}friend constexpr modint operator*(const modint&a,const modint&b){return modint(a)*=b;}friend constexpr modint operator/(const modint&a,const modint&b){return modint(a)/=b;}friend constexpr modint operator==(const modint&a,const modint&b){return a.x==b.x;}friend constexpr modint operator!=(const modint&a,const modint&b){return a.x!=b.x;}friend ostream&operator<<(ostream&os,const modint&a){return os<<a.x;}friend istream&operator>>(istream&is,modint&a){long long v;is>>v;a=modint(v);return is;}};#line 1 "/home/kotatsugame/library/math/squarematrix.cpp"#include<array>template<typename T,unsigned int N>struct Matrix{using arr=array<T,N>;using mat=array<arr,N>;mat dat;Matrix():dat(){}arr&operator[](unsigned int i){return dat[i];}const arr&operator[](unsigned int i)const{return dat[i];}static Matrix eye(){Matrix res;for(int i=0;i<N;i++)res[i][i]=1;return res;}Matrix operator+(const Matrix&A)const{Matrix res;for(int i=0;i<N;i++)for(int j=0;j<N;j++)res[i][j]=dat[i][j]+A[i][j];return res;}Matrix operator*(const Matrix&A)const{Matrix res;for(int i=0;i<N;i++)for(int j=0;j<N;j++)for(int k=0;k<N;k++)res[i][j]+=dat[i][k]*A[k][j];return res;}Matrix pow(long long n)const{Matrix a=*this,res=eye();for(;n;a=a*a,n>>=1)if(n&1)res=res*a;return res;}};#line 5 "a.cpp"using mint=modint<(int)1e9+7>;using Mat=Matrix<mint,6>;main(){long N;cin>>N;Mat A;for(int i=0;i<6;i++)A[0][i]=mint(6).inv();for(int i=0;i<5;i++)A[i+1][i]=1;A=A.pow(N);cout<<A[0][0]<<endl;}