Ive need this in some problems, but I can't figure out how to count it. I will be glad to useful ideas.
How many different arrays of length n are there of non-negative integers with sum of k; n <= 10^5, k <= 10^9
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
Ive need this in some problems, but I can't figure out how to count it. I will be glad to useful ideas.
How many different arrays of length n are there of non-negative integers with sum of k; n <= 10^5, k <= 10^9
I'm glad I became an expert, but i dont understand why my rating increased last div3 round. I had 1598 rating and finished ~600th. I was sure my rating would fall. Post about rating system says that my rating will increase if I place higher than expected. Wasn't my expected place ~1? (it was div3 (only <1600))
Maybe i dont understand math part of post, so can somebody tell my how rating changes actually works, please?
Name |
---|