http://www.elijahqi.win/archives/3014
Description
Input
输入含有多组数据,第一行一个正整数T,表示这个测试点内的数据组数。
接下来T行,每行有五个整数p,a,b,X1,t,表示一组数据。保证X1和t都是合法的页码。
注意:P一定为质数
Output
共T行,每行一个整数表示他最早读到第t页是哪一天。如果他永远不会读到第t页,输出-1。
Sample Input
3
7 1 1 3 3
7 2 2 2 0
7 2 2 2 1
Sample Output
1
3
-1
HINT
0<=a<=P-1,0<=b<=P-1,2<=P<=10^9
#include<map>
#include<queue>
#include<cmath>
#include<vector>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<algorithm>
#define ll long long
#define pa pair<int,int>
using namespace std;
inline char gc(){
static char now[1<<16],*S,*T;
if (T==S){T=(S=now)+fread(now,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<='9'&&ch>='0') x=x*10+ch-'0',ch=gc();
return x*f;
}
const int md=1e5+3;
struct node{int x,id,next;}hs[md];int h[md],num;
inline void init(){memset(h,0,sizeof(h));num=0;}
inline void insert1(int x,int id){static int tmp;
tmp=x%md;
for (int i=h[tmp];i;i=hs[i].next) if (hs[i].x==x) return;
hs[++num]=(node){x,id,h[tmp]};h[tmp]=num;
}
inline int query(int x){
static int tmp;tmp=x%md;
for (int i=h[tmp];i;i=hs[i].next) if (hs[i].x==x) return hs[i].id;
return -1;
}
int mod,T,A,B,x1,xn;
inline int ksm(ll b,int t){static ll tmp;tmp=1;
for (;t;(b*=b)%=mod,t>>=1) if (t&1) (tmp*=b)%=mod;return tmp;
}
int main(){
freopen("bzoj3122.in","r",stdin);
T=read();
while(T--){
mod=read();A=read();B=read();x1=read();xn=read();
if (x1==xn) {puts("1");continue;}
if (A==1&&!B) {puts("-1");continue;}
if (!A) {if (xn==B)puts("2");else puts("-1");continue;}
if (A==1){static ll invb,ans;
invb=ksm(B,mod-2);ans=1;ans=(invb*(xn-x1)%mod+mod)%mod;
printf("%lld\n",ans+1);continue;
}int m=ceil(sqrt(mod));int a=A,frac=(ll)B*ksm(a-1,mod-2)%mod,inva=ksm(a,mod-2);
int b=(ll)(xn+frac)*ksm(x1+frac,mod-2)%mod;static ll tmp,tmp1,ans;tmp=b;init();
for (int i=0;i<m;++i) insert1(tmp,i),(tmp*=inva)%=mod;tmp1=ksm(a,m);ans=-1;tmp=1;
for (int i=0;i<=m;++i){
ll j=query(tmp);
if (j!=-1) {ans=i*m+j+1;break;}(tmp*=tmp1)%=mod;
}printf("%lld\n",ans);
}
return 0;
}