C语言-递归法解斐波那契数列

#include<stdio.h>
#include<string.h>

int fib(int n) {
	if (n <= 2)return 1;
	return fib(n - 1) + fib(n - 2);
}
int main() {
	int n;

	scanf_s("%d", &n);

	printf("%d", fib(n));

	return 0;
}