bzoj 4522: [Cqoi2016]密钥破解

数论模板大集合

   
   

    
    

     
     #include<cstdio>
    
    
    
    

     
     #include<cstdlib>
    
    
    
    

     
     #include<cstring>
    
    
    
    

     
     #include<algorithm>
    
    
    
    

     
      
    
    
    
    

     
     #define ll long long
    
    
    
    

     
     #define inf 1e9
    
    
    
    

     
     #define eps 1e-8
    
    
    
    

     
     #define md
    
    
    
    

     
     using namespace std;
    
    
    
    

     
      
    
    
    
    

     
     ll mul(ll a,ll b,ll p)
    
    
    
    

     
     {
    
    
    
    

     
     	ll ans=0;
    
    
    
    

     
     	while (b)
    
    
    
    

     
     	{
    
    
    
    

     
     		if (b&1) ans=(ans+a)%p;
    
    
    
    

     
     		a=(a+a)%p; b>>=1;
    
    
    
    

     
     	}
    
    
    
    

     
     	return ans;
    
    
    
    

     
     }
    
    
    
    

     
      
    
    
    
    

     
     ll kpow(ll a,ll b,ll p)
    
    
    
    

     
     {
    
    
    
    

     
     	ll ans=1;
    
    
    
    

     
     	while (b)
    
    
    
    

     
     	{
    
    
    
    

     
     		if (b&1) ans=mul(ans,a,p);
    
    
    
    

     
     		a=mul(a,a,p); b>>=1;
    
    
    
    

     
     	}
    
    
    
    

     
     	return ans;
    
    
    
    

     
     }
    
    
    
    

     
      
    
    
    
    

     
     ll gcd(ll a,ll b) { return b==0?a:gcd(b,a%b);}
    
    
    
    

     
      
    
    
    
    

     
     ll get(ll n)
    
    
    
    

     
     {
    
    
    
    

     
     	ll x=abs(rand())%(n-1)+1,c=abs(rand())%(n-1)+1,y=x;
    
    
    
    

     
     	int j=2;
    
    
    
    

     
     	for (int i=1;;i++)
    
    
    
    

     
     	{
    
    
    
    

     
     		x=(mul(x,x,n)+c)%n;
    
    
    
    

     
     		ll t=gcd((y-x+n)%n,n);
    
    
    
    

     
     		if (t!=1&&t!=n) return t;
    
    
    
    

     
     		if (y==x) return n;
    
    
    
    

     
     		if (i==j) { y=x; j<<=1;}
    
    
    
    

     
     	}
    
    
    
    

     
     	return 233;
    
    
    
    

     
     }
    
    
    
    

     
      
    
    
    
    

     
     ll rho(ll n)
    
    
    
    

     
     {
    
    
    
    

     
     	ll p=n; while (p==1||p==n) p=get(n);
    
    
    
    

     
     	return p;
    
    
    
    

     
     }
    
    
    
    

     
      
    
    
    
    

     
     void exgcd(ll a,ll b,ll &x,ll &y)
    
    
    
    

     
     {
    
    
    
    

     
     	if (b==0) { x=1; y=0; return;}
    
    
    
    

     
     	exgcd(b,a%b,y,x); y-=(a/b)*x;
    
    
    
    

     
     }
    
    
    
    

     
      
    
    
    
    

     
     ll ni(ll a,ll b)
    
    
    
    

     
     {
    
    
    
    

     
     	ll x,y;
    
    
    
    

     
     	exgcd(a,b,x,y);
    
    
    
    

     
     	return (x%b+b)%b;
    
    
    
    

     
     }
    
    
    
    

     
      
    
    
    
    

     
     int main()
    
    
    
    

     
     {
    
    
    
    

     
     	ll e,N,c;
    
    
    
    

     
     	scanf("%lld%lld%lld",&e,&N,&c);
    
    
    
    

     
     	ll p=rho(N),q=N/p,r=(p-1)*(q-1),d=ni(e,r);
    
    
    
    

     
     	printf("%lld %lld\n",d,kpow(c,d,N));
    
    
    
    

     
     	return 0;
    
    
    
    

     
     }