Step 1: For positive integers, put
\(x'=x-1,\;y'=y-1,\;z'=z-1\ge0\).
Then
\[
x+y+z=n \Rightarrow x'+y'+z'=n-3.
\]
Number of ordered solutions for fixed sum \(n\) is
\({}^{n-1}C_2\).
Step 2: Required range:
\[
n=20\text{ to }50.
\]
Step 3: Total:
\[
{}^{50}C_3-{}^{19}C_3.
\]
This is option (C).