liumusi2022 @ 2022-07-13 16:00:58
#include<bits/stdc++.h>
using namespace std;
long long a, b, s, ans, mod = 1e8;
long long qpow(long long x, long long y)
{
long long s = 1;
while(y)
{
if(y & 1)
{
s = (x * s) % mod;
}
x = (x * x) % mod;
y >>= 1;
}
return s;
}
int main()
{
cin >> a >> b;
s = qpow(a, b);
for(int i = 1; i <= s / i; i++)
{
if(s % i == 0) ans += s / i + i;
if(i * i == s) ans -= i;
ans %= mod;
}
cout << ans % 9901;
return 0;
}
by Fish9块1 @ 2022-07-13 16:10:37
数论题,暴力
by liumusi2022 @ 2022-07-21 10:20:54
不行的