55 lines
1.1 KiB
C++
55 lines
1.1 KiB
C++
|
/*
|
||
|
|
* C++ Program to Find Factorial of a Number using Dynamic Programming
|
||
|
|
*/
|
||
|
|
#include <cstring>
|
||
|
|
#include <iostream>
|
||
|
|
#include <cstdlib>
|
||
|
|
#define ll long long
|
||
|
|
using namespace std;
|
||
|
|
|
||
|
|
int result[1000] = {0};
|
||
|
|
/*
|
||
|
|
* Find Factorial of a Number using Dynamic Programming
|
||
|
|
*/
|
||
|
|
ll fact_dp(int n)
|
||
|
|
{
|
||
|
|
if (n >= 0)
|
||
|
|
{
|
||
|
|
result[0] = 1;
|
||
|
|
for (int i = 1; i <= n; ++i)
|
||
|
|
{
|
||
|
|
result[i] = i * result[i - 1];
|
||
|
|
}
|
||
|
|
return result[n];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
/*
|
||
|
|
* Main
|
||
|
|
*/
|
||
|
|
int main()
|
||
|
|
{
|
||
|
|
int n;
|
||
|
|
while (1)
|
||
|
|
{
|
||
|
|
cout<<"Enter interger to compute factorial(0 to exit): ";
|
||
|
|
cin>>n;
|
||
|
|
if (n == 0)
|
||
|
|
break;
|
||
|
|
cout<<fact_dp(n)<<endl;
|
||
|
|
}
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
|
||
|
|
/*
|
||
|
|
|
||
|
|
Enter interger to compute factorial(0 to exit): 10
|
||
|
|
3628800
|
||
|
|
Enter interger to compute factorial(0 to exit): 20
|
||
|
|
2432902008176640000
|
||
|
|
Enter interger to compute factorial(0 to exit): 15
|
||
|
|
1307674368000
|
||
|
|
Enter interger to compute factorial(0 to exit): 0
|
||
|
|
|
||
|
|
------------------
|
||
|
|
(program exited with code: 1)
|
||
|
|
Press return to continue
|