I wrote this program code :
# include < iostream >
# include < iomanip >
using namespace std;
unsigned long factorial ( unsigned long );
int main ()
{
for ( int i = 0 ; i <= 10; i ++ )
cout << setw ( 2) << i << " ! = " << factorial (i) << endl;
return 0;
}
unsigned long factorial ( unsigned long number )
{
unsigned long product = 1;
for ( unsigned long i=1; i<=number; ++i )
{
product = product * i ;
}
return product;
}
How can I determine the largest fibonacci number that can be printed on my system ?