2 fibna.cpp

来自「数据结构的必做编程题」· C++ 代码 · 共 44 行

#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>

void Fib(int k, int max)
{
	int i=0,j=0,sum=0;
	
	int *q = (int *)malloc(k*sizeof(int));
		
	for(i=0;i<k-1;i++){  
		q[i]=0;
		 printf("%d\n",q[i]);
	}
	q[k-1] = 1;
	printf("%d\n",q[k-1]);
	    
	i=0;
	while(sum<=max){	
		sum=0;
		for(j=0;j<k;j++){
			sum=sum+q[j];
		}
		q[i++%k]=sum;
		if(sum<=max) printf("%d\n",sum);
		else break;
	}
}

void main (){
	
	int jie,max_number;
	
	printf("输入斐波那契序列的阶和最大值：\n");
	
	scanf("%d %d",&jie,&max_number);
	
	printf("\n小于%d的%d阶斐波那契序列为：\n",max_number,jie);
	Fib(jie,max_number);

}