What's the right approach of solving this Hackerearth Problem?
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
What's the right approach of solving this Hackerearth Problem?
Name |
---|
There's an editorial to this problem. If you're still confused after reading it, check Trick #4 here and modification of Sieve of Eratosthenes here.
Can you please Elaborate the 4 trick?
AN % MOD = AN % phi(MOD) % MOD
This is a natural outcome of Euler's Theorem. If you multiply a number phi(MOD) times modulo MOD you get 1. Suppose N/phi(MOD) = t.
So A^N % MOD can be written as ((A^phi(MOD))^t)%MOD * (A^(N%phi(MOD)))%MOD. Since the first term is 1 by Euler's Theorem you are left with (A^(N%phi(/MOD)))%MOD.
Pardon my illiteracy with respect to LATEX.