IMO 1996 - Shortlisted problems Question 26

C3 (USA) Let $k,m,n$ be integers such that $1\lt n\le m-1\le k$. Determine the maximum size of a subset $S$ of the set $\{1,2,3,\ldots,k\}$ such that no $n$ distinct elements of $S$ add up to $m$.