BZOJ2242 [SDOI2011]计算器

 1 //It is made by ljh2000
 2 #include <iostream>
 3 #include <cstdlib>
 4 #include <cstring>
 5 #include <cstdio>
 6 #include <cmath>
 7 #include <algorithm>
 8 #include <ctime>
 9 #include <vector>
10 #include <queue>
11 #include <map>
12 #include <set>
13 #include <string>
14 using namespace std;
15 typedef long long LL;
16 const int MOD = 300007;
17 const int MAXM = 100011;
18 int k,p,first[MOD+12],ecnt,to[MAXM],w[MAXM],next[MAXM],m,ans;
19 inline int gcd(int x,int y){ if(y==0) return x; return gcd(y,x%y); }
20 inline int fast_pow(LL x,int y){ LL r=1; while(y>0) { if(y&1) r*=x,r%=p; x*=x; x%=p; y>>=1;  } return (int)r; }
21 inline void wujie(){ printf("Orz, I cannot find x!"); }
22 inline int getint(){
23     int w=0,q=0; char c=getchar(); while((c<‘0‘||c>‘9‘) && c!=‘-‘) c=getchar();
24     if(c==‘-‘) q=1,c=getchar(); while (c>=‘0‘&&c<=‘9‘) w=w*10+c-‘0‘,c=getchar(); return q?-w:w;
25 }
26 
27 inline void exgcd(LL x,LL y,LL &d,LL &a,LL &b){
28     if(y==0) { d=x; a=1; b=0; return ; }
29     exgcd(y,x%y,d,b,a);
30     b-=x/y*a;
31 }
32 
33 inline void solve(int a,int Z){
34     int GCD=gcd(a,p); if(Z%GCD!=0) { wujie(); return ; }
35     LL x,y,GG; exgcd((LL)a,(LL)p,GG,x,y);
36     Z/=GCD; p/=GCD;
37     ans=Z*x%p; ans+=p; ans%=p;
38     printf("%d",ans);
39 }
40 
41 inline void insert(int x,int j){
42     int cc=x; x%=MOD; for(int i=first[x];i;i=next[i]) if(to[i]==cc) { w[i]=j; return ;}
43     next[++ecnt]=first[x]; first[x]=ecnt; to[ecnt]=cc; w[ecnt]=j; 
44 }
45 
46 inline int query(int x){
47     int cc=x; x%=MOD; for(int i=first[x];i;i=next[i]) if(to[i]==cc) return w[i];
48     return -1;
49 }
50 
51 inline void BSGS(int a,int b){
52     if(a%p==0) { wujie(); return; }
53     //if(b==1) { printf("0"); return ; }
54     ecnt=0; memset(first,0,sizeof(first)); 
55     m=sqrt(p); if(m*m<p) m++; LL cc=b; insert(b,0);
56     for(int i=1;i<=m;i++) cc*=a,cc%=p,insert((int)cc,i);
57     cc=1; LL cun=fast_pow(a,m);
58     for(int i=1;i<=m;i++) {
59         cc*=cun; cc%=p;    ans=query(cc);
60         if(ans==-1) continue;
61         printf("%d",i*m-ans); 
62         return ;
63     }
64     wujie();
65 }
66 
67 inline void work(){
68     int T=getint(); k=getint(); int x,y;
69     while(T--) {
70         x=getint(); y=getint(); p=getint();
71         if(k==1) printf("%d",fast_pow(x,y));
72         else if(k==2) solve(x,y);
73         else BSGS(x,y);
74         printf("\n");
75     }
76 }
77 
78 int main()
79 {
80     work();
81     return 0;
82 }