103.兔子产子(菲波那契数列)
【摘要】
#include<stdio.h>void main(){ int n,i,j,un1,un2,un; clrscr(); puts("********************************************************"); puts("* This is a program...
-
#include<stdio.h>
-
void main()
-
{
-
int n,i,j,un1,un2,un;
-
clrscr();
-
puts("********************************************************");
-
puts("* This is a program to Calculate Rabbits Numbers. *");
-
puts("* There is a rabbit couple procreats 2 rabbits 1 month,*");
-
puts("* and the young rabbits group and can procreats in the *");
-
puts("* end of the second month. In this way,how many rabbits*");
-
puts("* are there after n generations? *");
-
puts("********************************************************");
-
for(n=2;n<3;)
-
{
-
printf(" >> Please input number of generations (n>2): ");
-
scanf("%d",&n);
-
if(n<3) printf("\n >> Input error!\n"); /*控制输入正确的N值*/
-
}
-
un=un2=1;
-
printf(" >> The numbers of rabbits in first %d generation are as follows:\n",n);
-
printf(" l\t l\t");
-
-
for(i=3,j=0;i<=n;i++)
-
{
-
un1=un2;
-
un2=un;
-
un=un1+un2; /*利用通项公式求解N项的值*/
-
printf( i%8?" %d\t":"%d\n",un);
-
}
-
printf("\n");
-
printf("\n Press any key to quit...");
-
getch();
-
}
文章来源: blog.csdn.net,作者:程序员编程指南,版权归原作者所有,如需转载,请联系作者。
原文链接:blog.csdn.net/weixin_41055260/article/details/124558630
【版权声明】本文为华为云社区用户转载文章,如果您发现本社区中有涉嫌抄袭的内容,欢迎发送邮件进行举报,并提供相关证据,一经查实,本社区将立刻删除涉嫌侵权内容,举报邮箱:
cloudbbs@huaweicloud.com
- 点赞
- 收藏
- 关注作者
评论(0)