I want help with c++ please :). This is the exercise on description.

Question

A program that calculate a number of possible combination of n per m given by the formula:
n!/m!*(n-m)!
Where n!=1 for n = 0 and n!=1*2*3...*(n-1)*n for n>0
If someone can solve this for me I would appreciate that :)

Answer 1

Make a helper function that will calculate the factorial of value passed by the arguments.
Then return and store the factorial in the variable.
Then put all values in the formula.