Module/Week 2 ASSIGNMENT (INPUT/OUTPUT)
The number of permutations of a set of n items taken r at a time isgiven by the following
formulan!/r !(n- r )!: where n! is the factorial of n, r! is thefactorial of r, and (n-r)! is the
factorial of the result of n-r. The factorial of a number n can besolved using the following
formula: n!=e-n nn √ 2πn.
If there are 18 people in your class and you want to divide theclass into programming teams of 3
members, you can compute the number of different teams that can bearranged using this formula
(n!/r !(n- r )!).
Write a C++ program that determines the number of potential teamarrangements. You will need
to use the double type for this computation. Use the Lab Templateyou set-up last week, proper
formatting, and appropriate comments in your code. The output mustbe labeled clearly and
formatted neatly.
Submit C++ Programming Assignment 2 by 11:59 p.m. (ET) on Monday ofModule/Week 2
