Reference no: EM132432157

Problem:

How would this code be written out to get at correct answer?

The number of permutations of a set of n items taken r at a time is given by the following formulan!/r!(n-r)!: where n! is the factorial of n, r! is the factorial of r, and (n-r)! is the factorial of the result of n-r. The factorial of a number n can be solved using the following formula: n !=e-n nn √ 2 πn.

If there are 18 people in your class and you want to divide the class into programming teams of 3 members, you can compute the number of different teams that can be arranged using this formula (n!/r!(n-r)!).

When writing a C++ program that determines the number of potential team arrangements. You will need to use the double type for this computation.