can anyone tell me what is trick behind this problem?
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 151 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/23/2024 11:49:36 (k1).
Desktop version, switch to mobile version.
Supported by
No
I wouldn't call it trick though. Sum of divisors of number n = p1α1p2α2...pkαk is S = (1 + p1 + p12...p1α1)(1 + p2 + p22...p2α2)...(1 + pk + pk2...pkαk). If you want proof, consider small k's for getting logic or even you can induct on k. If k > 1, there are more than one > 1 multiplications in S, so it wouldn't be prime number. Only case you need to check is k = 1 so only the numbers pα can be "K-number" where p is prime and α is non-negative integer. I think it is enough to solve the problem.