https://uva.onlinejudge.org/contests/357-7b8c7371/12994.pdf
newbie here please bear with me
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | adamant | 156 |
5 | cry | 155 |
5 | atcoder_official | 155 |
5 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
https://uva.onlinejudge.org/contests/357-7b8c7371/12994.pdf
newbie here please bear with me
Название |
---|
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.