参考如下几篇:http://blog.csdn.net/MikeZHW/article/details/51969072
http://blog.csdn.net/wust_zzwh/article/details/51966450 (重点)
http://blog.csdn.net/popoqqq/article/details/43951401
有几个公式要总结
以及:
先了解两条性质,欧拉函数是积性函数;
(1)积性函数性质:F(m1*m2)=F(m1)*F(m2),当且近当gcd(m1,m2)=1时成立;
(2),其中p是n的素因子。这个用欧拉函数的素因子表达式很好证明。
上述引用自http://blog.csdn.net/wust_zzwh/article/details/51966450
PS:发现好多人数据跑出来结果不一样,都能AC?!
以下为数据:极限数据很多人RE?
2 100 5
123124 1241987 1298798
1 2 6
1 100 9
9000000 7004001 8000009
10000000 10000000 10000000
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <iostream>
using namespace std;
typedef long long LL;
const int maxn = 10000010;
const int mod = 1000000007;
int phi[maxn], sum[maxn];
void getfirst()
{
memset(phi, 0, sizeof(phi));
memset(sum, 0, sizeof(sum));
phi[1] = 1;
for (int i = 2; i < maxn; ++ i)
if (!phi[i])
for (int j = i; j < maxn; j += i)
{
if (!phi[j]) phi[j] = j;
phi[j] = phi[j] / i * (i - 1);
}
for (int i = 1; i < maxn; ++ i)
sum[i] = (sum[i - 1] + phi[i]) % mod;
}
LL f(int n, int m)
{
if (n == 0)
{
cout<<"@@"<<endl;
return 0;
}
if (m == 0) return 0;
if (n == 1) return sum[m];
if (m == 1) return phi[n];
if (phi[n] == n - 1) return ((LL)phi[n] * f(1, m) % mod+ f(n, m / n)) % mod; //判断是否是素数,优先判断避免总是循环
for (int i = 2; i * i <= n; ++ i)
if (!(n % i)) return ((LL)phi[i] * f(n/i, m) % mod+ f(n, m / i)) % mod;
}
LL powMod( LL a , LL b , LL p )//a^b % p
{
LL r = 1 ;
a %= p ;
while( b )
{
if( b&1 ) r = r*a%p ;
b >>= 1 ;
a = a*a%p ;
}
return r ;
}
LL gg(LL k, LL p)
{
if (p == 1) return 0;
if (p == 2) return k & 1;
return powMod(k, gg(k, phi[p]) + phi[p], p);
}
int main()
{
getfirst();
int n, m, p;
while (cin >> n >> m >> p)
{
LL k = f(n, m);
printf("%lld\n", gg(k, p));
}
return 0;
}