问题描述
我写了这个程序代码：
#include< iostream>
#include< iomanip>
使用命名空间std;
unsigned long factorial（unsigned long）;
int main（）
{
for（int i = 0; i< = 10; i ++）
cout<< setw（2）<< i<< " ！ = << factorial（i）<<结束;
返回0;
}
无符号长阶乘（无符号长数）
{
unsigned long product = 1;
for（unsigned long i = 1 ; i< = number; ++ i）
{
product = product * i;
}
退货;
}
如何确定最大的可以在我的系统上打印的斐波纳契数？
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 ?
推荐答案
嗨..
这就像勺子喂食...请尝试一些东西，而不是依赖别人。这是一个简单的程序，请尝试尝试...也请不要一次又一次地发送相同的查询。它激怒了很多。
这个查询我已经看了差不多3次....
自己试试....我已经给出了一个解决方案对于你的问题...尝试了解自己。另外请不要再问任何愚蠢的问题了。
Thanx
Hi..
This is like spoon feeding...Please try something rather than depending on others. This is a simple program and please try to give an attempt... Also please dont send the same query again and again. It irritates a lot.
This query I have seen for almost 3 times....
Try out yourself....I have already given a solution for your question...Try understanding yourself. Also please dont ask any stupid question again.
Thanx
首先找到系统上可以打印的最大数字。
然后问题变成找到最大的纤维数量或者等于数字
First find the largest number that can be printed on your system.
Then the problem becomes that of finding the largest fibbo number less or equal to a number
这篇关于任何人都可以通过斐波纳契计划帮助我吗？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持！