given three numbers p , q, r calculate the pow( p , q!) % r
It would also be helpful if you could mention the important concepts needed in solving this problem ,
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | djm03178 | 152 |
given three numbers p , q, r calculate the pow( p , q!) % r
It would also be helpful if you could mention the important concepts needed in solving this problem ,
Name |
---|
If $$$p$$$ and $$$r$$$ are relatively prime you use Euler's theorem $$$p^{\phi(r)} = 1$$$ mod $$$r$$$. So you need to calculate $$$q!$$$ mod $$$\phi(r)$$$. $$$\phi$$$ is the Euler totient function, for a prime $$$r$$$ it is just $$$r-1$$$. You can find the answer even if $$$(p, r) > 1$$$, but it involves additional steps.
Thanks a lot, could you also mention what else do I have to learn if (p,r)>1 or will Euler totient function suffice?
In that case you could perform prime decomposition of $$$r$$$. Find the remainder for each prime power and then use the Chinese remainder theorem.
Cant' we directly use the generalization??
from this link