POJ 2417 Discrete Logging BSGS

最新推荐文章于 2022-11-15 21:18:43 发布

YJEthan

最新推荐文章于 2022-11-15 21:18:43 发布

阅读量291

点赞数

分类专栏： # 其它

本文链接：https://blog.csdn.net/YJEthan/article/details/79078711

版权

其它专栏收录该内容

30 篇文章 0 订阅

订阅专栏

Given a prime P, 2 <= P < 2 ³¹, an integer B, 2 <= B < P, and an integer N, 1 <= N < P, compute the discrete logarithm of N, base B, modulo P. That is, find an integer L such that

    B^L == N (mod P)

Input

Read several lines of input, each containing P,B,N separated by a space.

Output

For each line print the logarithm on a separate line. If there are several, print the smallest; if there is none, print "no solution".

Sample Input

5 2 1
5 2 2
5 2 3
5 2 4
5 3 1
5 3 2
5 3 3
5 3 4
5 4 1
5 4 2
5 4 3
5 4 4
12345701 2 1111111
1111111121 65537 1111111111

Sample Output

0
1
3
2
0
3
1
2
0
no solution
no solution
1
9584351
462803587

Hint

The solution to this problem requires a well known result in number theory that is probably expected of you for Putnam but not ACM competitions. It is Fermat's theorem that states

   B^(P-1) == 1 (mod P)

for any prime P and some other (fairly rare) numbers known as base-B pseudoprimes. A rarer subset of the base-B pseudoprimes, known as Carmichael numbers, are pseudoprimes for every base between 2 and P-1. A corollary to Fermat's theorem is that for any m

   B^(-m) == B^(P-1-m) (mod P) .

不是很懂，暂时存下模板

#include<stdio.h>
#include<map>
#include<math.h>
using namespace std;

typedef long long ll;
map<int,int>hash;
map<int,bool>app;

ll exgcd(ll a,ll b,ll &x,ll &y)
{
    if(b==0)
    {
        x=1;y=0;return a;
    }
    ll res=exgcd(b,a%b,x,y);
    ll tmp=x;
    x=y;y=tmp-a/b*y;
    return res;
}
ll quicknow(ll a,ll t,ll m)
{
    ll ans=1,res=a;
    while(t)
    {
        if(t&1) ans=res*ans%m;
        res=res*res%m;
        t/=2;
    }
    return ans;
}
ll solve(ll a,ll b,ll m)
{
    a%=m;b%=m;
    ll t=ceil(sqrt(1.0*m));
    ll tmp=1;
    hash.clear();
    app.clear();
    for(ll i=0;i<t;i++)
    {
        if(app[tmp]) continue;
        hash[tmp]=i,app[tmp]=1;
        tmp=tmp*a%m;
    }
    ll now=1,x,y;
    ll c=quicknow(a,t,m);
    for(ll i=0;i<t;i++)
    {
        ll g=exgcd(now,m,x,y);
        x=((b/g)*x%m+m)%m;
        if(app[x])
        {
            ll j=hash[x];
            return i*t+j;
        }
        now=now*c%m;
    }
    return -1;
}
int main()
{
    ll p,b,n;
    while(scanf("%I64d%I64d%I64d",&p,&b,&n)!=EOF)
    {
        ll ans=solve(b,n,p);
        if(ans==-1) printf("no solution\n");
        else printf("%I64d\n",ans);
    }
    return 0;
}