C语言递归求斐波那契数列

#include <stdio.h>
int fib(int n) {
	if (n == 1 || n == 2) return 1;
	else return fib(n - 1) + fib(n - 2);
}

int main() {
	int t;
	printf("请输入t:");
	scanf("%d", &t);
	printf("第%d个为: %d", t, fib(t));
	return 0;
}