斐波那契的前n项积

  小爱密码

#include <iostream>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <string>
#include <cstdio>
#include <cstring>
#include <assert.h>
#include <functional>
#define  lowbit(x) (x&(-x))
#define  ll long long
#define  ull unsigned long long
#define  max(a,b) (a>b?a:b)
#define  min(a,b) (a>b?b:a)
#define  PI acos(-1.0)
#define  fir first
#define  sec second
#define  SZ(x) (x.size())
#define  inf 0x3f3f3f3f
#define  PB push_back
#define  MP make_pair
#define  all(x) (x).begin(),(x).end()
#define  PII pair<ll,ll>
#define  E 2.7182818284590452353602874713527
using namespace std;

/**********************************************Head-----Template****************************************/
bool Finish_read;
template<class T>inline void read(T &x){Finish_read=0;x=0;ll f=1;char ch=getchar();while(!isdigit(ch)){if(ch=='-')f=-1;if(ch==EOF)return;ch=getchar();}while(isdigit(ch))x=x*10+ch-'0',ch=getchar();x*=f;Finish_read=1;}
template<class T>inline void prll(T x){if(x/10!=0)prll(x/10);putchar(x%10+'0');}
template<class T>inline void writeln(T x){if(x<0)putchar('-');x=abs(x);prll(x);putchar('\n');}
template<class T>inline void write(T x){if(x<0)putchar('-');x=abs(x);prll(x);}
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
//const ll mod = 10000019;
//const ll phi_mod_prime=mod-1;
ll ksm(ll a,ll b,ll mod){ll ans=1;a%=mod;for(;b;b>>=1){if(b&1) ans=ans*a%mod;a=a*a%mod;}return ans;}
ll phi(ll n){ ll rea=n;for(ll i=2;i*i<=n;i++){if(n%i==0){ rea=rea-rea/i;while(n%i==0) n/=i;}}if(n>1) rea=rea-rea/n;return rea;}
//a^(b%phi(mod)+phi(mod))%mod;
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b){x=1;y=0;d=a;}else exgcd(b,a%b,y,x,d),y-=a/b*x;}
inline ll inv(ll a,ll p){ll x,y,d;exgcd(a,p,x,y,d);x=(x%p+p)%p;return x;}
/********************************Head----Template**********************************************/


void mul(ll a[2][2],ll b[2][2],ll mod){
    ll c[2][2];
    memset(c,0,sizeof(c));
    for(ll i=0;i<2;i++) {
        for(ll j=0;j<2;j++){
            for(ll k=0;k<2;k++){
                c[i][k]=1ll*(c[i][k]+1ll*a[i][j]*b[j][k]%mod)%mod;
            }
        }
    }
    memcpy(a,c,sizeof(c));
}

ll FibA(ll n,ll mod){
    ll f[2][2]={{1,0},{0,0}};
    ll A[2][2]={{1,1},{1,0}};
    for(;n;n>>=1) {
        if(n&1) mul(f,A,mod);
        mul(A,A,mod);
    }
    return f[0][1];
}

ll solve(ll A,ll B,ll C,ll D,ll mod,ll n){
    ll Mod=phi(mod);
    ll f[2][2]={{1,0},{0,0}};
    ll AA[2][2]={{1,1},{1,0}};
    ll nn=n;
    for(;n;n>>=1) {
        if(n&1) mul(f,AA,Mod);
        mul(AA,AA,Mod);
    }
    ll cntA=f[0][1]+Mod;//f[n+1];
    ll cntB=f[0][0]-1+Mod;//f[n+2]-1;
    ll cntD=cntA+cntB-nn%Mod+Mod;//cntA+cntB-1
    
    ll ans=ksm(A,cntA,mod);
    ll CD=ksm(C,D%Mod+Mod,mod);//C^D
    ans=ksm(B,cntB,mod)*ans%mod;
    ans=ans*ksm(CD,cntD,mod)%mod;
    return ans;
}

/**
给出A,B,C,D,mod,n;
F[1]=A
F[2]=B
F[n]=F[n-1]*F[n-2]*(C^D)
求G(n)%mod G(n)为F[n]的前n项积;
*/

int main (){
    ll A,B,C,D,mod,n;
    while(~scanf("%lld %lld %lld %lld %lld %lld",&A,&B,&C,&D,&mod,&n)){
       ll ans;
       if(n==1) ans=A%mod;
       else if(n==2) ans=A*B%mod;
       else ans=solve(A,B,C,D,mod,n);
       printf("%09lld\n",ans);
       //writeln(ans);
    }
    return 0;
}
/**
1 1 9 2 6 4
2 2 2 2 1000 3
7 9 3 4 6 5

840187716 394382927 783099223 798440033 911647357 197551370
233779921
3

840187716 394382927 783099223 798440033 0
927472405 945492601 2586980992
114817576

*/