一个很简单的推导,不想说了
就是指数很大,然后要取模,但是x可能和(s+1)不一定互质
那么欧拉定理就不能用了,但是欧拉定理在不互质的情况下,如果xymods
如果y<phi[s],直接算出来,否则,xy=xy%phi[s]+phi[s]mods
暴力推一下,超过phi[s]了没就行
代码:
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
#define MAX 100005
#define MAXN 6005
#define maxnode 10
#define sigma_size 30
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lrt rt<<1
#define rrt rt<<1|1
#define middle int m=(r+l)>>1
#define LL long long
#define ull unsigned long long
#define mem(x,v) memset(x,v,sizeof(x))
#define lowbit(x) (x&-x)
#define pii pair<int,int>
#define bits(a) __builtin_popcount(a)
#define mk make_pair
#define limit 10000
//const int prime = 999983;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f;
const double pi = acos(-1.0);
//const double inf = 1e18;
const double eps = 1e-8;
//const LL mod = 1e9+7;
const ull mx = 133333331;
/*****************************************************/
inline void RI(int &x) {
char c;
while((c=getchar())<'0' || c>'9');
x=c-'0';
while((c=getchar())>='0' && c<='9') x=(x<<3)+(x<<1)+c-'0';
}
/*****************************************************/
bool prime[MAX];
int pr[MAX];
int tot;
LL mod;
struct Matrix{
int n;
LL maze[maxnode][maxnode];
void init(int n){
this->n = n;
mem(maze,0);
}
Matrix operator * (Matrix &rhs){
Matrix m;
m.init(n);
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
for(int k=0;k<n;k++)
m.maze[i][j] = (m.maze[i][j] + maze[i][k] * rhs.maze[k][j])%mod;
//mod可以在二重循环的地方模
return m;///
}
}A;
int flag;
LL qpow(Matrix a,LL n){
Matrix ans;
ans.init(a.n);
for(int i=0;i<ans.n;i++) ans.maze[i][i] = 1;
while(n){
if(n&1) ans = ans * a;
a = a*a;
n >>= 1;
}
return (ans.maze[0][0]+ans.maze[0][1])%mod;
}
void init(){
mem(prime,0);
tot=0;
for(int i=2;i<MAX;i++){
if(!prime[i]){
for(int j=2*i;j<MAX;j+=i) prime[j]=1;
pr[tot++]=i;
}
}
}
int cal(int x){
int ans=1;
for(int i=0;i<tot&&pr[i]*pr[i]<=x;i++){
if(x%pr[i]==0){
ans*=(pr[i]-1);
x/=pr[i];
while(x%pr[i]==0){
ans*=pr[i];
x/=pr[i];
}
}
}
if(x!=1) ans*=(x-1);
return ans;
}
LL ppow(LL a,LL n,LL mo){
LL ans=1;
while(n){
if(n&1) ans=ans*a%mo;
a=a*a%mo;
n>>=1;
}
return ans;
}
LL f[100],g[100];
int main(){
int t;
cin>>t;
init();
while(t--){
int n,y,x,s;
scanf("%d%d%d%d",&n,&y,&x,&s);
int phi=cal(s+1);
mod=phi;
A.init(4);
A.maze[0][0]=1;A.maze[0][1]=4;A.maze[0][2]=1;A.maze[0][3]=4;
A.maze[1][0]=0;A.maze[1][1]=4;A.maze[1][2]=1;A.maze[1][3]=4;
A.maze[2][0]=0;A.maze[2][1]=1;A.maze[2][2]=0;A.maze[2][3]=0;
A.maze[3][0]=0;A.maze[3][1]=2;A.maze[3][2]=0;A.maze[3][3]=1;
int i=2;
f[0]=0,f[1]=1;
g[0]=0,g[1]=1;
for(;;i++){
f[i]=2*f[i-1]+f[i-2];
g[i]=g[i-1]+f[i]*f[i];
if(g[i]>=mod) break;
}
if((LL)n*y>=i) flag=1;
if((LL)n*y==0){
cout<<1%(s+1)<<endl;
continue;
}
LL ans=qpow(A,(LL)n*y-1);
if(flag) ans+=mod;
cout<<ppow(x,ans,(LL)s+1)<<endl;
}
return 0;
}