1000C50 +2.999C49 +3.998C48 +......... +51.950C0
$$\binom{1000}{50}+2\cdot \binom{999}{49}+3\cdot \binom{998}{48}+\cdots\cdots \cdots \cdots +51\cdot \binom{950}{0} $$
I tried to apply the pascal rule but failed as there are some numbers with the binomial coefficients, any hint would be helpful thanks.
A purely combinatorial solution is possible, though it takes some experience to see it before knowing what the sum is. Let $S=\{0,1,\ldots,1001\}$. You want to count the subsets of $S$ having $952$ elements.
Suppose that $A$ is such a subset, and $k$ is its second-smallest element: there is exactly one member of $A$ smaller than $k$, and $950$ members of $A$ are larger than $k$. There are $k$ elements of $S$ smaller than $k$, so there are $k$ ways to choose the one member of $A$ that is smaller than $k$. There are $1001-k$ elements of $S$ bigger than $k$, so there are $\binom{1001-k}{950}$ ways to choose the $950$ elements of $A$ that are bigger than $k$. Thus, there are
$$k\binom{1001-k}{950}$$
$950$-element subsets of $S$ whose second-largest member is $k$. The smallest possible value of $k$ is $1$, since there has to be at least one member of $S$ smaller than $k$, and the largest is $51$, since there have to be at least $950$ members of $S$ larger than $k$, so the total number of $950$-element subsets of $S$ is
$$\begin{align*} \sum_{k=1}^{51}k\binom{1001-k}{950}&=\sum_{k=1}^{50}k\binom{1001-k}{(1001-k)-950}\\ &=\sum_{k=1}^{51}k\binom{1001-k}{51-k}\\ &=\binom{1000}{50}+2\binom{999}{49}+3\binom{998}{48}+\ldots+50\binom{951}1+51\binom{950}0\;. \end{align*}$$
On the other hand, there are $\binom{1002}{950}=\binom{1002}{52}$ subsets of $S$ with $950$ elements, so
$$\binom{1000}{50}+2\binom{999}{49}+3\binom{998}{48}+\ldots+50\binom{951}1+51\binom{950}0=\binom{1002}{952}\;.$$