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 n n √ 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)!). Write a C++ program that determines the number of potential team arrangements. You will need to use the double type for this computation. Use the Lab Template you set-up last week, proper formatting, and appropriate comments in your code. The output must be labeled clearly and formatted neatly.
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
n
n
√ 2πn.
If there are 18 people in your class and you want to divide the class into
members, you can compute the number of different teams that can be arranged using this formula
(n!/r!(n−r)!).
Write a C++ program that determines the number of potential team arrangements. You will need
to use the double type for this computation. Use the Lab Template you set-up last week, proper
formatting, and appropriate comments in your code. The output must be labeled clearly and
formatted neatly.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
