| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3650 |
| 2 | Benq | 3582 |
| 3 | Geothermal | 3570 |
| 3 | orzdevinwang | 3570 |
| 5 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3532 |
| 8 | Radewoosh | 3522 |
| 9 | Um_nik | 3483 |
| 10 | jiangly | 3468 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 151 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
I have a question about the problem above in the title. If instead dp,I use bruteforcing??? For example in the first input "3 3 2", with bruteforce I would have these: 1 1, 1 2, 1 3, ... ... 1 1 1, 1 1 2, 1 1 3, 1 2 1, 1 2 2, 1 2 3, .....
For each one,I would check the sum and if it has at least d. Program would run more than 1 second??
1)When you check, you add one sequence to answer, but you see that in problem your answer would be by modulo 10^9+7, so easy to think that there are many such sequences, and it would run much more than 1 second
2) The number of sequences which consist M edjes is about C(n-1, m) when k = n, for example C(99, 50) more than 10^18
Ok sir. Thank you !!!