Update 求斐波那契数列

求斐波那契数列

@@ -0,0 +1,19 @@
+#include<stdio.h>
+int Fibon1(int n)
+{
+    if(n == 1||n == 2)
+    {
+        return 1;
+    }
+    else{
+        return Fibon1(n-1) + Fibon1(n-2);
+    }
+}
+int main()
+{
+    int n,s;
+    scanf("%d",&n);
+    s = Fibon1(n);
+    printf("%d",s)
+    return 0;
+}