5728：PowMod

题目描述

Declare:
$k=\sum_{i=1}^{m} \varphi (i*n)\ mod\ 1000000007$

$n$ is a square-free number.

$\varphi $ is the Euler's totient function.

find:
$ans=k^{k^{k^{k^{...^k}}}}\ mod \ p$

There are infinite number of $k$

输入解释

Multiple test cases(test cases $\leq 100$), one line per case.

Each line contains three integers, $n, m$ and $p$.

$1 \leq n, m, p \leq 10^{7}$

输出解释

For each case, output a single line with one integer, ans.

输入样例

1 2 6
1 100 9

输出样例

4
7

来自杭电HDUOJ的附加信息

Author	HIT
Recommend	wange2014

该题目是Virtual Judge题目，来自杭电HDUOJ

题目来源 2016 Multi-University Training Contest 1

源链接： HDU-5728

最后修改于 2020-10-25T23:25:09+00:00 由爬虫自动更新

共提交 0 次

通过率 --%

时间上限	内存上限
3000/1500MS(Java/Others)	262144/262144K(Java/Others)