[UVA] 369 - Combinations
Combinations
Computing the exact number of ways that N things can be taken M at a
time can be a great challenge when N and/or M become very large. Challenges
are the stuff of contests. Therefore, you are to make just such a
computation given the following:
...
