斐波那契数列，递归返回Fibonacci数列第N项

for循环返回Fibonaccidi第N项

#include<stdio.h>
int main()
{
	int n;
	scanf("%d", &n);
	int b = 1, c = 1, d;
	if (n == 1 || n == 2)
	{
		printf("1");
	}
	else
	{
		for (int i = 2; i < n; i++)
		{
			d = b;
			b = c;
			c = d;
			b = b + c;

		}
		printf("%d", b);
	}
}

 打印Fibonacci数列

#include<stdio.h>
int main()
{
	int n; 
	scanf("%d", &n);
	int b = 1, c = 1,d;
	if (n == 1 )
	{
		printf("1");
	}
	else if (n == 2)
	{
		printf("1,1");
	}
	else
	{
		printf("1,1");
		for (int i = 2; i < n; i++)
		{
			d = b;
			b = c;
			c = d;
			b = b + c;
			printf(",%d", b);
		}
	
	}
}

 递归返回Fibonacci数列第N项

#include<stdio.h>
int fn(int n)
{
	if (n == 1 || n == 2)
	{
		return 1;
	}
	else
	{
		return fn(n - 1) + fn(n - 2);
	}
}
int main()
{
	int a;
	scanf("%d", &a);
	int b = fn(a);
	printf("%d", b);
}

 作者是初学者，代码有点笨

还请谅解   ~(^-^)~