登月计划
【题目描述】
HJA在和学弟学数学,于是便有了一道非常简单的数学题:求满足 的最小自然数x。
【输入格式】
输入数据一行三个正整数a、b、p,我们保证p是一个质数。
【输出格式】
一行一个整数代表最小的自然数x,如果不存在这样的x输出-1。
【样例输入】
2 1 3
【样例输出】
0
【数据范围与规定】
对于30%的数据,1≤p≤1000。
对于100%的数据,1≤a,b
#include <cstdio>
#include <map>
#include <cmath>
#include <iostream>
#define LL long long
using namespace std;
const int siz = 1e6 + 5;
LL p, a, b;
int head[siz], last[siz], edge;
LL dest[siz][2], jj;
LL mult(LL x, LL y, LL MOD) {
x = x % MOD, y = y % MOD;
return ((x*y-(LL)(((long double)x*y+0.5)/MOD)*MOD)%MOD+MOD)%MOD;
}
/*
LL mult(LL x, LL y, LL MOD){
LL lf = x * (y >> 20) % MOD * (1ll << 20) % MOD;
LL rg = x * (y & ((1ll << 20) - 1)) % MOD;
return (lf + rg) % MOD;
}*/
inline LL power(LL base, LL idx){
LL a = 1;
while( idx ){
if(idx & 1) a = mult(a , base , p);
base = mult(base , base , p);
idx = idx>>1;
}
return a;
}
void adde(LL a, LL b) {
LL key = a % siz;
for(int t=head[key]; t; t=last[t])
if(dest[t][0] == a) { dest[t][1] = b; return;}
edge++;
last[edge] = head[key];
dest[edge][0] = a;
dest[edge][1] = b;
head[key] = edge;//链表防冲突
}
LL query(LL a) {
LL key = a % siz;
for(int t=head[key]; t; t=last[t])
if(dest[t][0] == a) return dest[t][1];//return j;
return -1;
}
inline LL BSGS(LL a, LL b){
LL m = ceil( sqrt(p) ), mul = 1, val = b % p, am;
for(register LL j=1; j<=m; ++j){
mul = mult(mul, a, p);//a^j
val = mult(mul, b, p);//b*a^j
adde(val, j);//hash
}
am = mul, mul = 1;
for(register LL i=1; i<=m; ++i){
mul = mult(mul, am, p);//a^(m*i)
jj = query(mul);
if(jj != -1) return i * m - jj;
}
return -1;
}
int main(){
freopen ("braveheart.in", "r", stdin);
freopen ("braveheart.out", "w", stdout);
scanf("%I64d%I64d%I64d", &a, &b, &p);
printf("%I64d\n", BSGS(a, b) % p);
return 0;
}