I was doing one problem and thought of maximum number of divisors. What I want to say is : We iterate from 1 to N (N<=10^9) and define S(i) number of divisors of number i. What is maximum S we can get? I think it is about 100 or maybe less but if someone can prove.
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
19:38:18
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
19:38:18
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 22.11.2024 21:56:43 (k3).
Десктопная версия, переключиться на мобильную.
При поддержке
1344
Let n = p1α1 * p2α2 * ... * pkαk
To maximize number of divisors, according to count of divisors formula, you have to find maximum value of (α1 + 1) * (α2 + 1) * ... * (αk + 1) with constraints n ≤ 109. Answer is n = 931170240 = 26 * 32 * 51 * 71 * 111 * 131 * 171 * 191 with 1344 divisors.
UPD: As, nickitat said, answer is 1344.
Related: the maximum number of divisors for any n-digit number, along with the numbers with this much divisors (1, 2), are very useful when constructing maximal test cases in certain problems, either problemsetting or hacking.