You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
41 lines
1.0 KiB
C++
41 lines
1.0 KiB
C++
5 years ago
|
/*
|
||
|
|
* C++ Program to Compute Combinations using Factorials
|
||
|
|
*/
|
||
|
|
#include<iostream>
|
||
|
|
using namespace std;
|
||
|
|
|
||
|
|
long long C(int n, int r)
|
||
|
|
{
|
||
|
|
long long f[n + 1];
|
||
|
|
f[0] = 1;
|
||
|
|
for (int i = 1; i <= n; i++)
|
||
|
|
f[i] = i * f[i - 1];
|
||
|
|
return f[n] / f[r] / f[n - r];
|
||
|
|
}
|
||
|
|
//Main
|
||
|
|
int main()
|
||
|
|
{
|
||
|
|
int n, r, m;
|
||
|
|
while (1)
|
||
|
|
{
|
||
|
|
cout<<"Enter total number of objects:(0 to exit) ";
|
||
|
|
cin>>n;
|
||
|
|
if (n == 0)
|
||
|
|
break;
|
||
|
|
cout<<"Enter number of objects to be chosen: ";
|
||
|
|
cin>>r;
|
||
|
|
cout<<"Number of Combinations: "<<C(n, min(r, n - r))<<endl;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
Enter total number of objects:(0 to exit) 10
|
||
|
|
Enter number of objects to be chosen: 2
|
||
|
|
Number of Combinations: 45
|
||
|
|
Enter total number of objects:(0 to exit) 5
|
||
|
|
Enter number of objects to be chosen: 2
|
||
|
|
Number of Combinations: 10
|
||
|
|
Enter total number of objects:(0 to exit) 15
|
||
|
|
Enter number of objects to be chosen: 7
|
||
|
|
Number of Combinations: 6435
|
||
|
|
Enter total number of objects:(0 to exit) 0
|