hdu 2815 Mod Tree (扩展BSGS算法)
题意：k^D=n(%p),求最小的D (1<=K, P, N<=10^9)
思路：出题人英文水平捉鸡。。。。
BSGS
2017
BZOJ 2480: Spoj3105 Mod (扩展BSGS算法，模板)
Description # 已知数a,p,b，求满足a^x≡b(mod p)的最小自然数x。
poj 2417 Discrete Logging (BSGS算法)
题目链接
题意：
Given a prime P, 2 <= P < 231, 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 BL == N (mod P)