結果
| 問題 | No.1595 The Final Digit |
| ユーザー |
 mugen_1337
|
| 提出日時 | 2021-07-09 21:36:55 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 3 ms / 2,000 ms |
| コード長 | 5,679 bytes |
| コンパイル時間 | 2,230 ms |
| コンパイル使用メモリ | 202,688 KB |
| 最終ジャッジ日時 | 2025-01-22 21:07:51 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 17 |
ソースコード
#include<bits/stdc++.h>using namespace std;#define ALL(x) begin(x),end(x)#define rep(i,n) for(int i=0;i<(n);i++)#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;#define mod 1000000007using ll=long long;const int INF=1000000000;const ll LINF=1001002003004005006ll;int dx[]={1,0,-1,0},dy[]={0,1,0,-1};// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}struct IOSetup{IOSetup(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(12);}} iosetup;template<typename T>ostream &operator<<(ostream &os,const vector<T>&v){for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");return os;}template<typename T>istream &operator>>(istream &is,vector<T>&v){for(T &x:v)is>>x;return is;}template<typename T>struct Matrix{vector<vector<T>> a;Matrix(){}Matrix(int n):a(n,vector<T>(n,0)){}Matrix(int h,int w):a(h,vector<T>(w,0)){}int h()const{return (int)a.size();}int w()const{return (int)a[0].size();}const vector<T> &operator[](int k)const{return a.at(k);// reference}vector<T> &operator[](int k){return a.at(k);}Matrix id(int n){Matrix ret(n);for(int i=0;i<n;i++) ret[i][i]=1;return ret;}Matrix &operator+=(const Matrix &rhs){assert(h()==rhs.h() and w()==rhs.w());for(int i=0;i<h();i++)for(int j=0;j<w();j++) (*this)[i][j]+=rhs[i][j];return (*this);}Matrix &operator-=(const Matrix &rhs){assert(h()==rhs.h() and w()==rhs.w());for(int i=0;i<h();i++)for(int j=0;j<w();j++) (*this)[i][j]-=rhs[i][j];return (*this);}Matrix &operator*=(const Matrix &rhs){assert(w()==rhs.h());vector<vector<T>> res(h(),vector<T>(rhs.w()));for(int i=0;i<h();i++)for(int j=0;j<rhs.w();j++)for(int k=0;k<w();k++)res[i][j]=res[i][j]+(*this)[i][k]*rhs[k][j];swap(a,res);return (*this);}Matrix operator+(const Matrix &rhs)const{return Matrix(*this)+=rhs;}Matrix operator-(const Matrix &rhs)const{return Matrix(*this)-=rhs;}Matrix operator*(const Matrix &rhs)const{return Matrix(*this)*=rhs;}Matrix pow(long long k){Matrix ret=Matrix::id(h());Matrix b=Matrix(*this);while(k){if(k&1) ret*=b;b*=b;k>>=1;}return ret;}T det(){assert(h()==w());Matrix x(*this);T ret=1;for(int i=0;i<w();i++){int idx=-1;for(int j=i;j<w();j++)if(x[j][i]!=0) idx=j;if(idx==-1) return 0;// 三角行列の対角成分の1つが0if(i!=idx){ret*=-1;swap(x[i],x[idx]);}T b=x[i][i];ret*=b;for(int j=0;j<w();j++) x[i][j]/=b;for(int j=i+1;j<w();j++){T t=x[j][i];for(int k=0;k<w();k++) x[j][k]-=x[i][k]*t;}}return ret;}};template<ll Mod>struct ModInt{long long x;ModInt():x(0){}ModInt(long long y):x(y>=0?y%Mod:(Mod-(-y)%Mod)%Mod){}ModInt &operator+=(const ModInt &p){if((x+=p.x)>=Mod) x-=Mod;return *this;}ModInt &operator-=(const ModInt &p){if((x+=Mod-p.x)>=Mod)x-=Mod;return *this;}ModInt &operator*=(const ModInt &p){x=(int)(1ll*x*p.x%Mod);return *this;}ModInt &operator/=(const ModInt &p){(*this)*=p.inverse();return *this;}ModInt operator-()const{return ModInt(-x);}ModInt operator+(const ModInt &p)const{return ModInt(*this)+=p;}ModInt operator-(const ModInt &p)const{return ModInt(*this)-=p;}ModInt operator*(const ModInt &p)const{return ModInt(*this)*=p;}ModInt operator/(const ModInt &p)const{return ModInt(*this)/=p;}bool operator==(const ModInt &p)const{return x==p.x;}bool operator!=(const ModInt &p)const{return x!=p.x;}ModInt inverse()const{int a=x,b=Mod,u=1,v=0,t;while(b>0){t=a/b;swap(a-=t*b,b);swap(u-=t*v,v);}return ModInt(u);}ModInt pow(long long n)const{ModInt ret(1),mul(x);while(n>0){if(n&1) ret*=mul;mul*=mul;n>>=1;}return ret;}friend ostream &operator<<(ostream &os,const ModInt &p){return os<<p.x;}friend istream &operator>>(istream &is,ModInt &a){long long t;is>>t;a=ModInt<Mod>(t);return (is);}static int get_mod(){return Mod;}};using mint=ModInt<10>;signed main(){ll p,q,r;ll K;cin>>p>>q>>r>>K;Matrix<mint> mat(4);// Matrix<ll> res(4);// rep(i,4) res[i][i]=1;mat[0][0]=1;mat[0][1]=1;mat[0][2]=1;mat[0][3]=0;mat[1][0]=1;mat[2][1]=1;mat[3][2]=1;auto res=mat.pow(K-3);// while(K){// if(K&1){// Matrix<ll> nres(4);// rep(i,4)rep(j,4){// rep(k,4) nres[i][j]+=mat[i][k]*res[k][j];// nres[i][j]%=10;// }// swap(res,nres);// }// Matrix<ll> nmat(4);// rep(i,4)rep(j,4){// rep(k,4) nmat[i][j]+=mat[i][k]*mat[k][j];// nmat[i][j]%=10;// }// swap(mat,nmat);// K>>=1;// }mint ans=res[0][0]*r+res[0][1]*q+res[0][2]*p;cout<<ans<<endl;return 0;}