There are $100$ cards with a unique number from $1$ to $100$ written over them. How many ways can someone pick exactly $5$ cards where the numbers on them sum to $100$?
I am not sure but this could be a variation of the subset sum problem. But one of my acquaintances got this problem on the GRE test, which seems unlikely given that the problem is beyond the mathematical skill level tested on the GRE. So I am asking is there a simplistic solution to this problem? If not, I am also happy with the non-simplistic solution with a bit of explanation, since I lack the mathematical aptitude required to understand the Wolfram Mathworld link.