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
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. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
sahilshelangia | 2020-05-18 13:31:47 | 16 | (published) | |
| en1 |
|
sahilshelangia | 2020-05-18 13:31:04 | 194 | Initial revision (saved to drafts) |