What's the right approach of solving this Hackerearth Problem?
What's the right approach of solving this Hackerearth Problem?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 153 |
| 2 | nik_exists | 151 |
| 3 | maroonrk | 150 |
| 4 | maspy | 149 |
| 5 | AmShZ | 146 |
| 6 | Um_nik | 143 |
| 7 | Errichto | 139 |
| 8 | adamant | 135 |
| 9 | BledDest | 134 |
| 10 | cry | 130 |
| 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.