Number of ways of forming 10 student committee from 5 classes of 30 students each There are 5 classes with 30 students each. How many ways can a committee of 10 students be formed if each class has to have at least one student on the committee?
I figured that we first have to choose 5 people from each class, so there are $10^5$ options. There remain total of 29*5=145 students to choose from, and we can fill remaining 5 spots any way we want, i.e., $\binom{145}{5}$ options. Thus, I thought answer would be $$10^5 \dot\ \binom{145}{5} $$.
Apparently this is the wrong answer. I can see how the inclusion/exclusion principle also leads to the right answer. That is,
$$  {150 \choose 10}- 5{120 \choose 10} + {5 \choose 2}{90 \choose 10} - {5 \choose 3}{60 \choose 10} + {5 \choose 4}{30 \choose 10} $$
I don't see though what I overlooked and why my answer is different? 
Any advice on when to simply use inclusion/exclusion and when to use other methods?

Here is how it works without inclusion-exclusion.
There are 7 ways of partitioning 10 into 5 positive parts. The number may be checked here https://oeis.org/A008284
The problem is similar to a poker game hands problem but here we have 5 colors and 30 values.
For each kind of "hand" we have to do the specific calculus.
$case \ 10=6+1+1+1+1$ : 
there are $\binom{5}{1}$ choices of the long color. For each one, there are $\binom{30}{6}$ choices of the values. For each other short color there are  ${\binom{30}{1}}$ choices, for a total of :
$\binom{5}{1} \binom{30}{6}{\binom{30}{1}}^4$
$case \ 10=5+2+1+1+1$ :
there are $\binom{5}{1}$ choices of the long color. There are $\binom{4}{1}$ choices for the color of a pair. For the long color, there are $\binom{30}{5}$ choices of the values. For the pair there are  ${\binom{30}{2}}$ choices; the total is  for a total of:
$\binom{5}{1} \binom{4}{1} \binom{30}{5} \binom{30}{2} {\binom{30}{1}}^3$
Let's write for the sake of comparing the complete formula:
$$\binom{5}{1} \binom{30}{6}{\binom{30}{1}}^4 + \binom{5}{1} \binom{4}{1} \binom{30}{5} \binom{30}{2} {\binom{30}{1}}^3 + \binom {5}{1} \binom{4}{1}\binom{30}{4}\binom{ 30}{3}\binom{30}{1}^3+ \binom{5}{1} \binom{4}{2} \binom{ 30}{4} \binom{ 30}{2}^2 \binom{30}{1}^2 + \binom{5}{1} \binom{4}{2} \binom{ 30}{2} \binom{ 30}{3}^2 \binom{30}{1}^2 + \binom{5}{1} \binom{4}{1} \binom{ 30}{3} \binom{ 30}{1} \binom{30}{2}^3 + \binom{30}{2}^5 $$
After computing all seven cases, we get the required 645666069796875. I think, given the similarity with poker where there are involved a lot of money, someone would have invented in the last centuries a shorter way of computing hands. 
The inclusion-exclusion is possible since we can manipulate that "at least one" and the calculus is shorter since the classes are equal.  
