Give me some tips to solve- uva 10692 problem.. - problem link:https://uva.onlinejudge.org/external/106/10692.pdf
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 163 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | awoo | 158 |
6 | atcoder_official | 157 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 148 |
Give me some tips to solve- uva 10692 problem.. - problem link:https://uva.onlinejudge.org/external/106/10692.pdf
Name |
---|
A ^ x % m = A ^ (x % phi [M] + phi [M]) % m (x >= phi [M])
(phi [M] M is the Euler function)you can recursively go to solution.
Why do we need to sum up
phi[M]
inA ^ (x % phi [M] + phi [M]) % m
? Isn'tA ^ (x % phi[M]) % m
good enough?In case
x % φ[M]
is equal to0
,A^0 % M
will become one, which may not be same asA^φ{M} % M
e.g. (2 ^ 0) % 10 = 1, (2 ^ 4) % 10 = 6, phi[10] = 4;
Thanks.. if u explain How/Why its works?
it is necessary to dfs like that
Can you or someone else please reply why this equation works? Is this true for any A and m ?
Here's the AC code may help you, be careful that we should test if b in ab is greater than φ(m)