https://uva.onlinejudge.org/contests/357-7b8c7371/12994.pdf
newbie here please bear with me
# | 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 |
https://uva.onlinejudge.org/contests/357-7b8c7371/12994.pdf
newbie here please bear with me
Name |
---|
First let's solve case with length 2. a*B + a = N <=> a*(B + 1) = N, it means that multipliers are divisors of N, so you need check all of them. Calculate primes up to sqrt(10^14), factorise N using them and recursively build all divisors, check them for correctness. Then solve case with length >= 4. It is easy to prove B in that case is < N^(1/3), so you can check all B up to it.