we are given N red balls and M blue balls, we have to find no. of arrangements of (n+m) balls such that no more than k balls are of same color.
1<n,m,k<=1000
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
1 | maomao90 | 161 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
5 | atcoder_official | 148 |
8 | Petr | 146 |
9 | nor | 144 |
10 | TheScrasse | 143 |
count no. of ways.
we are given N red balls and M blue balls, we have to find no. of arrangements of (n+m) balls such that no more than k balls are of same color.
1<n,m,k<=1000
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en2 |
![]() |
sahilshelangia | 2020-05-18 13:31:47 | 16 | (published) | |
en1 |
![]() |
sahilshelangia | 2020-05-18 13:31:04 | 194 | Initial revision (saved to drafts) |
Название |
---|