Problem from https://coj.uci.cu/24h/problem.xhtml?pid=3850 exponial(n) = n^(exponial(n-1))
How to calculate exponial(n) mod M?
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
3 | adamant | 159 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 150 |
6 | atcoder_official | 148 |
6 | SecondThread | 148 |
8 | nor | 147 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
Problem from https://coj.uci.cu/24h/problem.xhtml?pid=3850 exponial(n) = n^(exponial(n-1))
How to calculate exponial(n) mod M?
Name |
---|
You can use Euler theorem to prove that
.
Even then, it is still O(N log M) right?
It should be much lower than that. Here is a code that implements this problem. I've written it just now.
An idea which might help to prove why it works is that
(for a composite c).
L.E.: According to A007755 it seems that the iterated euler totient function takes O(logC) iterations and an iteration takes
time.
We can stop when reach c = 1
Can you prove it? For example, a = 2, b = 5, c = 8 is a counterexample.
Well, a and c have to be co-prime. Seems like it's not the case here though.
Yes, it is the reason because of I chose that example. However, Can it be used to solve the problem? I mean, exponial(n) and m may not be coprime. I think that you can still solve the problem for each prime factor of m, but I was not sure if it would be optimal.
As it says on the online judge, this is from NCPC '16. You can find the solutions here: https://ncpc.idi.ntnu.no/ncpc2016/