please someone that help me whith this problem http://www.spoj.com/problems/POWERUP/ i'm using the fermat little theorem a^p-1=a (mod p). Grace in advance
# | 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 | maomao90 | 165 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
5 | nor | 151 |
7 | atcoder_official | 147 |
8 | TheScrasse | 146 |
9 | Petr | 145 |
10 | SecondThread | 142 |
please someone that help me whith this problem http://www.spoj.com/problems/POWERUP/ i'm using the fermat little theorem a^p-1=a (mod p). Grace in advance
Name |
---|
By Fermat theorem a^phi(m) == a (mod m) => a^(phi(m) — 1) == 1 (mod m). In this problem m == 10^9 + 7 is prime, so phi(m) == m — 1.
So A^(B^C) (mod m) == A^(B^C mod (phi(m) — 1)) (mod m) == A^(B^C mod (m — 2)) (mod m).
Yes, I'm applying that theory,but the judge sentence is wrong answer. I would appreciate if you provide me extreme cases in which my code it can fail
You are wrong, aφ(m) = 1.
Savinov thanks, it really aφ (m) = 1.
It's Euler theorem, not Fermat's theorem...
There are some tricky cases when a mod p == 0
``