PoJ 2417 Discrete Logging BSGS裸题

Description

Given a prime P, 2 <= P < 2 31, 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) .

---

就是求指数，也就是离散对数的值，直接BSGS，这次写的是map的，下次写哈希表吧

#include <cmath>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <map>
using namespace std;  
long long a,b,c,m;  
map<long long,int> mp;  
long long fast_pow( long long x, long long y ) {
    long long BASE = x, tmp = 1;
    while( y ) {
        if( y & 1 ) tmp = ( tmp * BASE ) % c;
        y >>= 1;
        BASE = ( BASE * BASE ) % c;
    }
    return tmp;
}
long long gcd( long long x, long long y ) { return y == 0 ? x : gcd( y, x % y ); }
int main() {
    while( scanf( "%lld%lld%lld", &c, & a, &b ) != EOF ) { //A^x=B(mod C)
        mp.clear();bool judge = false;
        if( gcd( a, c ) != 1 ) {
            printf( "no solution\n" );
            continue;
        }
        m = ceil( sqrt ( c ) );
        long long ans;
        for( register int i = 0; i <= m; i++ ) {
            if( i == 0 ){ ans = b % c; mp[ans] = i; continue; }
            ans = ( ans * a ) % c;
            mp[ans] = i;
        } 
        long long am = fast_pow( a, m ); ans = 1;
        for( register int i = 1; i <= m; i++ ) {
            ans = ( ans * am ) % c;
            if( mp[ans] ) {
                int tmp = i * m - mp[ans];
                printf( "%d\n", ( tmp % c + c ) % c );
                judge = true;
                break;
            }
        }
        if( judge == false ) printf( "no solution\n" );
    }
    return 0;
}