This is a classic example of the "stars and bars" problem where the formula to calculate the number of ways to distribute \(n\) identical objects into \(k\) distinct boxes is given by:
\[
\binom{n-1}{k-1}
\]
In this case, \(n = 10\) and \(k = 8\), so the number of ways is:
\[
\binom{10-1}{8-1} = \binom{9}{7} = 36
\]