So the specific question I was asked was to find the number of ways $3$ numbers between $0$ to $99$ can add up to $100$, but I'm curious if this can also be generalized.
So far I've figured out that if we need to add $2$ integers to a number $n$, we simply have $n-1$ different ways as follows:
$1 + n-1$
$2 + n-2$
$3 + n-3$
...
$n-1 + 1$
Edit: I think the stars and bars problem is pretty much the same as my question except im not allowed to use the number 'n' itself. I.e 0+0+100 is not allowed(though 0+50+50 is)
I think my answer would be C(n+k-1, k-1) - k