| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
UVA 13085
Problem Name: Forming Teams
Problem link: https://uva.onlinejudge.org/contests/364-bb2339ba/13085.pdf
I understand that for a number n I need to find out all of its divisors and then I need to find out the possible combinations for each divisor. I could not figure out how to come up with the combinations. Any help is really appreciated.
Please help :'(
Hey Fam. Since I have to divide it into equal teams, the first thing that should strike is that I count the divisors in O(sqrt(n)) time and then I can calculate the sum over all them. What I means is that suppose you have two divisors such that d1*d2 = n, you have two choices form d1 groups with d2 elements or vice versa. Suppose I do the former(it'd be obvious for the latter). So I have to select d2 persons from n, then select again d2 persons from n — d2 persons.. so on. So, this would give answer to be (n!)/((d2!)^(d1)). But there's a catch as all the groups are identical, we have to divide it by (d1!) also. So, my answer becomes sum of this over all the divisors. I hope you get it.