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 | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
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 |
---|