Sequence( 分块+矩阵快速幂 )

题目链接

 #include<bits/stdc++.h>
 using namespace std;
  #define e exp(1)
  #define pi acos(-1)
  #define mod 1000000007
  #define inf 0x3f3f3f3f
  #define ll long long
  #define ull unsigned long long
  #define mem(a,b) memset(a,b,sizeof(a))
 int gcd(int a,int b){return b?gcd(b,a%b):a;}

 ll A,B,C,D,N,P;
 struct mat {
     ll a[][];
 }c;

 mat mat_mul(mat x,mat y) {
     mat s;
     mem(s.a,);
     for(int i=;i<;i++)
         for(int j=;j<;j++)
         for(int k=;k<;k++)
         s.a[i][j]=(s.a[i][j]+x.a[i][k]*y.a[k][j]%mod)%mod;
     return s;
 }

 mat mat_pow(ll n) {
     mat res;
     mem(res.a,);
     res.a[][]=res.a[][]=res.a[][]=;
     while(n) {
         if(n&) res=mat_mul(res,c);
         c=mat_mul(c,c);
         n>>=;
     }
     return res;
 }

 ll solove(ll i) {
     ll l=i,r=N;
     ll p=P/i;
     while(l<r) {
         int mid=r-(r-l)/;
         if(p==P/mid) l=mid;
         else if(p>P/mid)r=mid-;
         else l=mid+;
     }
     return l;
 }

 int main() {
     int T;scanf("%d",&T);
     while(T--) {
         scanf("%lld%lld%lld%lld%lld%lld",&A,&B,&C,&D,&P,&N);
         if(N==){printf("%lld\n",A);continue;}
         if(N==){printf("%lld\n",B);continue;}
         ll f1=B; ll f2=A; mat ans;
         for(ll i=; i<=N;) {
             ll j=solove(i);
             mem(c.a,);
             c.a[][]=D;c.a[][]=C;
             c.a[][]=;c.a[][]=;
             c.a[][]=P/i; ans=mat_pow(j-i+);
             ll ff1=(ans.a[][]*f1%mod+ans.a[][]*f2%mod+ans.a[][])%mod;
             ll ff2=(ans.a[][]*f1%mod+ans.a[][]*f2%mod+ans.a[][])%mod;
             f1=ff1; f2=ff2; i=j+;
         }
         printf("%lld\n",f1);
     }
     return ;
 }