嗯,在三天之后,我终于把这题A了qaq
太神了。orz po姐题解:portal(配合评论食用效果更佳哟)
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
inline char gc(){
static char buf[1<<16],*S,*T;
if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
return x*f;
}
int h[N],num=0;
struct Hash_table{
int next,key,val;
}data[N];
inline void ins(int key,int val){
int x=key%N;
for(int i=h[x];i;i=data[i].next){
if(data[i].key==key) return;
}data[++num].next=h[x];h[x]=num;data[num].key=key;data[num].val=val;
}
inline int hs(int key){
int x=key%N;
for(int i=h[x];i;i=data[i].next){
if(data[i].key==key) return data[i].val;
}return -1;
}
inline ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
inline ll ksm(ll x,ll k,int mod){
ll res=1;for(;k;k>>=1,x=x*x%mod) if(k&1) res=res*x%mod;return res;
}
inline int getrt(int mod,int phi){
int i;
for(i=2;i;++i){
bool pd=1;
for(int j=2;j*j<=phi;++j)
if(phi%j==0&&ksm(i,phi/j,mod)==1){pd=0;break;}
if(pd) return i;
}
}
inline ll BSGS(ll a,ll b,ll mod,ll phi){
int m=ceil(sqrt(mod));memset(h,0,sizeof(h));num=0;
ll e=ksm(a,phi-1,mod),x=b;
for(int i=0;i<m;++i){
ins(x,i);x=x*e%mod;
}e=ksm(a,m,mod),x=1;
for(int i=0;i<=m;++i){
int j=hs(x);if(j!=-1) return i*m+j;x=x*e%mod;
}
}
inline ll solve(ll a,ll b,ll p,ll d){
int mod=ksm(p,d,inf);b%=mod;
if(!b) return ksm(p,d-((d-1)/a+1),inf);
ll tmp=0;while(b%p==0) b/=p,++tmp;
if(tmp%a) return 0;d-=tmp;mod=ksm(p,d,inf);
ll phi=mod-mod/p;int g=getrt(mod,phi);
ll indb=BSGS(g,b,mod,phi),t=gcd(a,phi);
if(indb%t) return 0;return t*ksm(p,tmp-tmp/a,inf);
}
int main(){
// freopen("a.in","r",stdin);
int tst=read();
while(tst--){
int a=read(),b=read(),k=read(),x=2;ll ans=1;k=k<<1|1;
for(x;x*x<=k&&ans;++x){
if(k%x) continue;int cnt=0;
while(k%x==0) k/=x,++cnt;ans*=solve(a,b,x,cnt);
}if(ans&&k!=1) ans*=solve(a,b,k,1);
printf("%lld\n",ans);
}return 0;
}