in problem 27E[problem:http://codeforces.net/contest/27/problem/E] you are asked to find the smallest positive integer which has exactly n divisors .
how to solve it >
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 166 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 160 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
how to find least number with given amount of divisor !
in problem 27E[problem:http://codeforces.net/contest/27/problem/E] you are asked to find the smallest positive integer which has exactly n divisors .
how to solve it >
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | atlasworld | 2018-09-21 22:19:03 | 16 | |||
en1 | atlasworld | 2018-09-21 22:18:04 | 231 | Initial revision (published) |
Name |
---|