| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3839 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | Geothermal | 3569 |
| 8 | ecnerwala | 3494 |
| 9 | Um_nik | 3396 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Um_nik | 164 |
| 2 | -is-this-fft- | 162 |
| 3 | maomao90 | 159 |
| 3 | atcoder_official | 159 |
| 5 | cry | 158 |
| 5 | awoo | 158 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | TheScrasse | 153 |
| 10 | Dominater069 | 152 |
So here's the problem -
I need to find the minimum divisions required with a divisor 'd', to equalize at least k elements in the array.
For eg. for array {64,25,33,30}, divisor=2 and k=2 ->
Divide 64 two times to get 16 and 33 one time to get 16. So array becomes {16,25,16,30} which has k=2 elements equal. And so minimum divisions required = 3.
you can use a map for each number with an array for store number of division asume your example :if we divide 25 with 2 it will be the follow :first we insert 0 in 25 array beacause there are not any dision yet then 25/2=12 and we store 1 in 12 array beacause we divide 25 once time then 12/2=6 and store 2 in 6 array because we divide 25 twice and so on .and we do this method with other number and loop over this number and get the least k division .this take o(nlogn). hope it well.
didnt got u?