diff --git "a/2224020137/\347\254\2541\347\253\240/\345\211\215n\351\241\271\346\225\264\346\225\260\345\222\214" "b/2224020137/\347\254\2541\347\253\240/\345\211\215n\351\241\271\346\225\264\346\225\260\345\222\214"
new file mode 100644
index 0000000000000000000000000000000000000000..2aa69e9326f7f93b71e374de62be4ce4100b934a
--- /dev/null
+++ "b/2224020137/\347\254\2541\347\253\240/\345\211\215n\351\241\271\346\225\264\346\225\260\345\222\214"
@@ -0,0 +1,6 @@
+long aaa(long n)
+{
+    int a;
+    a=n*(n+1)/2;
+    return a;
+}
\ No newline at end of file
diff --git "a/2224020137/\347\254\2541\347\253\240/\346\211\200\346\234\211\345\245\207\346\225\260\351\225\277\345\272\246\345\255\220\346\225\260\347\273\204\347\232\204\345\222\214" "b/2224020137/\347\254\2541\347\253\240/\346\211\200\346\234\211\345\245\207\346\225\260\351\225\277\345\272\246\345\255\220\346\225\260\347\273\204\347\232\204\345\222\214"
new file mode 100644
index 0000000000000000000000000000000000000000..47c98f6000c41ed7f5fd53111fdf89153290f7e6
--- /dev/null
+++ "b/2224020137/\347\254\2541\347\253\240/\346\211\200\346\234\211\345\245\207\346\225\260\351\225\277\345\272\246\345\255\220\346\225\260\347\273\204\347\232\204\345\222\214"
@@ -0,0 +1,29 @@
+#include <stdio.h>
+void twosum(int nums[],int *sum1,int *sum2,int size)
+{
+    *sum1=0;
+    *sum2=0;
+    for(int i=0;i<size;i++)
+    {
+        *sum1+=nums[i];
+    }
+}
+
+
+int main()
+{
+    int size;
+    printf("输入数组的大小：");
+    scanf("%d", &size);
+
+    int nums[size];
+    printf("输入数组的元素:\n");
+    for (int i = 0; i < size; i++)
+    {
+        scanf("%d", &nums[i]);
+    }
+    int sum1,sum2;
+    twosum(nums,&sum1, &sum2,size);
+    printf("总和为：%d\n",sum1+sum2);
+    return 0;
+}
\ No newline at end of file
diff --git "a/2224020137/\347\254\2541\347\253\240/\347\264\240\346\225\260\347\232\204\344\270\252\346\225\260" "b/2224020137/\347\254\2541\347\253\240/\347\264\240\346\225\260\347\232\204\344\270\252\346\225\260"
new file mode 100644
index 0000000000000000000000000000000000000000..4b1bd0442bd544ff4dbb7d2c99db8a855e83ae4f
--- /dev/null
+++ "b/2224020137/\347\254\2541\347\253\240/\347\264\240\346\225\260\347\232\204\344\270\252\346\225\260"
@@ -0,0 +1,33 @@
+#include<stdio.h>
+#include<time.h>
+#include<math.h>
+bool prime1(long n)
+{
+	long j;
+	for(j=2;j<n;j++)
+		if(n%j==0)
+			return false;
+	return true;
+}
+void PrimeTime1(long n)
+{
+	clock_t t;
+	long sum=0,k;
+	t=clock();
+	for(k=2;k<=n;k++)
+		if(prime1(k))
+			sum++;
+	t=clock()-t;
+	printf("方法1:\n");
+	printf(" 结果:2~%d的素数个数:%d\n",n,sum);
+	printf(" 用时:%lf秒\n",((float)t)/CLOCKS_PER_SEC);
+}
+int main()
+{
+	long n;
+	printf("n(大于100000):");
+	scanf("%d",&n);
+	if(n<10000)return 0;
+	PrimeTime1(n);
+	return 1;
+ }
\ No newline at end of file