given n and k. there are total 10 groups and each group can have at most k value. So we have to find the number of ways that sum upto n . but each group has upper limit K.
here constraints are 1<=n,k<=1e9; n<=10*k
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3947 |
2 | ecnerwala | 3654 |
3 | jiangly | 3627 |
4 | jqdai0815 | 3620 |
5 | orzdevinwang | 3612 |
6 | Benq | 3586 |
7 | Radewoosh | 3582 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3474 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | atcoder_official | 154 |
5 | maroonrk | 152 |
6 | -is-this-fft- | 148 |
6 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 145 |
10 | cry | 144 |
given n and k. there are total 10 groups and each group can have at most k value. So we have to find the number of ways that sum upto n . but each group has upper limit K.
here constraints are 1<=n,k<=1e9; n<=10*k
Название |
---|
I see GE Vernova guys here.
ya it was asked in Ge Vernova . but i wanted to know how to solve it given the constraints.