diff --git "a/37 \346\217\255\351\230\263\344\270\275/20221208 \346\225\260\347\273\204.txt" "b/37 \346\217\255\351\230\263\344\270\275/20221208 \346\225\260\347\273\204.txt"
new file mode 100644
index 0000000000000000000000000000000000000000..7a259ba02b408930e46b5492642ec895479a18c1
--- /dev/null
+++ "b/37 \346\217\255\351\230\263\344\270\275/20221208 \346\225\260\347\273\204.txt"	
@@ -0,0 +1,23 @@
+```JAVA
+package 储存;
+
+    import java.util.Scanner;
+    public class A1 {
+        public static void main(String[] args) {
+            int [] arr = {5};
+            Scanner sc =new Scanner(System.in);
+            for (int p=0;p<arr.length;p++){
+                System.out.println("请输入第" +(p + 1) + "个元素：");
+                arr[p] = sc.nextInt();
+            }
+            System.out.println("五个元素是：");
+            for (int k=0;k<5;k++){
+                System.out.println(arr[k]+" ");
+            }
+        }
+    }
+
+```
+
+第七次作业
+
diff --git "a/37 \346\217\255\351\230\263\344\270\275/20221212 \344\275\234\344\270\232.txt" "b/37 \346\217\255\351\230\263\344\270\275/20221212 \344\275\234\344\270\232.txt"
new file mode 100644
index 0000000000000000000000000000000000000000..2191b6c5fd829ea595f9dc431f75a1812302ff57
--- /dev/null
+++ "b/37 \346\217\255\351\230\263\344\270\275/20221212 \344\275\234\344\270\232.txt"	
@@ -0,0 +1,36 @@
+```java
+{
+    // 在编程竞赛中，有五个评委为参加选手打分，分数0——100的整数分，选手的最后得分为：去掉一个最高分和一个最低分，另外三个评委的平均值（不考虑小数部分。）
+    public static void main(String[] args) {
+        Random ra = new Random();
+        int[] fenshu = new int[6];
+        for (int i=0 ;i<fenshu.length;i++) {
+            int suiji = ra.nextInt(101);
+            fenshu[i] = suiji;
+        }
+        for (int i=0;i<=5;i++){
+            System.out.println(fenshu[i]+"");
+        }
+        int min=fenshu[0];
+        int max=fenshu[0];
+        for (int i=0;i<fenshu.length;i++){
+            if(min>fenshu[i]){
+                min=fenshu[i];
+            }
+            if (max<fenshu[i]){
+                max=fenshu[i];
+            }
+        }
+        int sum=0;
+        int cout=0;
+        for (int i=0;i<fenshu.length;i++){
+            if (min!=fenshu[i]|| max!=fenshu[i]){
+                sum+=fenshu[i];
+                cout++;
+            }
+        }
+        System.out.println("\n最小值："+min+"最大值："+max+"平均值："+sum/cout);
+    }
+}
+```
+