【BSGS模板题】【TJOI2007】可爱的质数

Description

click me

Solution

BSGS模板题。

BSGS用于求离散对数的问题，大概就是求解$a^x\equiv b\pmod {p}$这样的同余方程。

BSGS主要思想

令$m=\sqrt{p-3}$求出$a^1\cdots a^{m-1}$，然后枚举$a^m,a^{2m}\cdots$，每次求$b$乘$a^{km}$的乘法逆元，然后在$a^1\cdots a^{m-1}$中找即可。
所以时间复杂度是$O(\sqrt {p}log_2p)$。

Code

/**************************
 * Au: Hany01
 * Date: Jan 15th, 2018
 * Prob: luogu3846
 * Email: hany01@foxmail.com
**************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define fir first
#define sec second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (1000000007)
#define debug(...) fprintf(stderr, __VA_ARGS__)

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read()
{
    register int _, __; register char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

inline void File()
{
#ifdef hany01
    freopen("luogu3846.in", "r", stdin);
    freopen("luogu3846.out", "w", stdout);
#endif
}

map<int, int> mp;
LL p, a, b, num, anum, tmp, invtmp, tmpp;

inline LL Pow(LL a, LL b) {
    LL Ans = 1;
    for ( ; b; a = a * a % p, b >>= 1) if (b & 1) (Ans *= a) %= p;
    return Ans;
}

int main()
{
    File();
    p = read(); a = read(); b = read();
    if (!(a % p)) { puts("no solution"); return 0; }
    num = ceil(sqrt(p - 3)), tmp = 1;
    rep(i, num) mp[tmp] = i, (tmp *= a) %= p;
    anum = tmp, tmp = 1;
    rep(i, num) {
        invtmp = Pow(tmp, p - 2);
        if (mp.count(tmpp = invtmp * b % p)) {
            cout << i * num + mp[tmpp] << endl;
            return 0;
        }
        (tmp *= anum) %= p;
    }
    puts("no solution");
    return 0;
}
//辔摇衔铁。蹴踏平原雪。
//    -- 张炎《清平乐·平原放马》