'commit'

C++专题课程/基础知识/Fibonacci数列原始方法.cpp

@@ -0,0 +1,25 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main() {
+	long int i,n;
+	scanf("%ld",&n);
+	long int a[n+1];
+	a[1]=1;
+	a[2]=1;
+	if(n>2) {
+		for(i=3; i<=n; i++) {
+			a[i]=a[i-1]+a[i-2];
+			//printf("%ld\n",a[i]);
+		}
+
+	}
+	//printf("%ld",a[n]);
+
+	long int t=a[n]%10007;
+	printf("%ld\n",t);
+	
+	printf("%ld\n",55%10007);
+	return 0;
+}
+
+