- 这道题算是比较综合的一道数论的题目。
- 输入1时可以直接用快速幂解决
(别告诉我你连快速幂都不会)
下面就是代码:
ll quickmul(ll a, ll b, ll mod) {//快速乘
ll re = 0;
while(b) {
if(b & 1) re += a;
re %= mod;
b >>= 1;
a += a;
a %= mod;
}
return re;
}
ll quickpow(ll a, ll b, ll mod) {//快速幂
ll re = 1;
while(b) {
if(b & 1) re = quickmul(re, a, mod);
re %= mod;
b >>= 1;
a = quickmul(a, a, mod);
a %= mod;
}
return re;
}
- 输入2时用一个扩展gcd解决:把
x
∗
y
≡
z
m
o
d
p
x*y \equiv z\mod p
x∗y≡zmodp转换成
x
y
+
k
p
=
z
xy + kp = z
xy+kp=z 就可以解决了。
下面是代码:
ll exgcd(ll a, ll b, ll &x, ll &y) {
if(b == 0) {
x = 1;
y = 0;
return a;
}
ll d = exgcd(b, a % b, x, y);
ll z = x;
x = y;
y = z - (a / b) * y;
return d;
}
- 输入3时就变成了一个离散对数问题,但是这道题的p是质数不用考虑合数的算法,主要思想是分块:
设 x = A ∗ p + B x = A*\sqrt{p} + B x=A∗p+B
a A ∗ p + B ≡ b m o d p a^ {A*\sqrt{p} + B}≡b\mod p aA∗p+B≡bmodp
a A ∗ p ≡ b ∗ a − B m o d p a^ A*\sqrt{p}≡b * a^ {-B}\mod p aA∗p≡b∗a−Bmodp
求出 A , B A,B A,B就能算出 x x x
复杂度为O( p \sqrt{p} p);
最后上整个程序:
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int t, type;
ll a, b, p;
map<ll, ll> mp;
ll read() {
ll s = 0, f = 1;
char ch;
for(; ch < '0' || ch > '9'; ch = getchar()) if(ch == '-') f = -1;
for(; ch >= '0' && ch <= '9'; ch = getchar()) s = (s << 1)+(s << 3) + ch - '0';
return s * f;
}
ll quickmul(ll a, ll b, ll mod) {
ll re = 0;
while(b) {
if(b & 1) re += a;
re %= mod;
b >>= 1;
a += a;
a %= mod;
}
return re;
}
ll quickpow(ll a, ll b, ll mod) {
ll re = 1;
while(b) {
if(b & 1) re = quickmul(re, a, mod);
re %= mod;
b >>= 1;
a = quickmul(a, a, mod);
a %= mod;
}
return re;
}
ll exgcd(ll a, ll b, ll &x, ll &y) {
if(b == 0) {
x = 1;
y = 0;
return a;
}
ll d = exgcd(b, a % b, x, y);
ll z = x;
x = y;
y = z - (a / b) * y;
return d;
}
ll gcd(ll xx, ll yy) {
return !yy ? xx : gcd(yy, xx % yy);
}
int main() {
freopen ("calc.in", "r", stdin);
freopen ("calc.out", "w", stdout);
scanf("%d%d", &t, &type);
while(t--) {
ll x, y;
a = read();
b = read();
p = read();
if(type == 1) {
printf("%lld\n", quickpow(a, b, p));
}
if(type == 2) {
ll d = exgcd(a, p, x, y);
if(b % d) puts("Orz, I cannot find x!");
else {
ll temp = p / d;
while(x < 0) x += temp;
printf("%lld\n", ((x * b / d) % temp + temp) % temp);
}
}
if(type == 3) {
bool flag = 0;
if(b % gcd(a, p)) {
puts("Orz, I cannot find x!");
continue;
}
a %= p;
b %= p;
mp.clear();
int m = ceil(sqrt(p));
for(int i = 0; i < m; ++i, b = quickmul(b, a, p)) mp[b] = i;
for(int i = 1, j = a = quickpow(a, m, p); i <= m ; ++i, j = quickmul(j, a, p)) {
if(mp.count(j) && i * m >= mp[j]) {
flag = 1;
printf("%lld\n", i * m - mp[j]);
break;
}
}
if(!flag) puts("Orz, I cannot find x!");
}
}
return 0;
}
这是我第一篇题解,写得不好请见谅。