递归求斐波那契数列

#include<stdio.h>#include<stdlib.h>int f(int x){    if(x==1 || x==2)            return 1;    else        return f(x-1)+f(x-2);}int main(){    int i,j,k,m,n,x,y;    scanf("%d",&n);    printf("%d\n",f(n));    return 0;    }