Update README.md

README.md

@@ -1,2 +1,61 @@
 # Htu
+//斐波那契数列
+#include<stdio.h>
+int fib(int n)
+{
+	int f1=1;
+	int f2=1;
+	int fn,i;
+	if(n==1||n==2)
+		return 1;
+	for(i=3;i<=n;i++)
+	{
+		fn=f2+f1;
+		f1=f2;
+		f2=fn;
+	}
+		return fn;
+}
+int main()
+{
+	int n;
+	int i;
+	int fn;
+	scanf("%d",&n);
+	fn=fib(n);
+	printf("%d",fn);
+}
+//判断素数（是素数输出Yes，反之则输出No）
+#include <stdio.h>
+#include <math.h>
+int primenumber (int n)
+{
+	int i = 0;
+ 	int q = sqrt(n);
+ 	for (i = 2; i <= q; i++ ) 
+	{
+  		if(n % i  == 0) 
+		{
+   			break;
+  		}
+ 	}
+ 	if (i > q) 
+	{
+  		return 1;
+ 	} 
+	else 
+	{
+  		return 2; 
+ 	}
+} 
+int main() 
+{
+ 	int n;
+ 	scanf("%d", &n);
+	if(primenumber(n)==1)
+		printf("Yes");
+ 	else
+ 		printf("No");
+	return 0;
+}