Putnam 1996 A5

If $p$ is a prime number greater than 3 and $k = \lfloor 2p/3 \rfloor$, prove that the sum $$\binom{p}{1} + \binom{p}{2} + \cdots + \binom{p}{k}$$ of binomial coefficients is divisible by $p^2$.