• 4.16上机作业


    package a;
    
    import java.util.Scanner;
    
    public class ma {
    
    	public static void main(String[] args) {
    		int a[] = new int[10];
    		int sum = 0, max = 0, min = 1000;
    		System.out.println("请输入分数");
    		for (int i = 0; i < a.length; i++) {
    			Scanner input = new Scanner(System.in);
    			a[i] = input.nextInt();
    		}
    		for (int j = 0; j < a.length; j++) {
    			if (a[j] > max) {
    				max = a[j];
    			}
    		}
    		for (int x = 0; x < a.length; x++) {
    			if (a[x] < min) {
    				min = a[x];
    			}
    		}
    		for (int y = 0; y < a.length; y++) {
    			sum += a[y];
    		}
    		System.out.println("平均分是" + (sum -max-min)/ 8.0);
    	}
    
    }
    

      

    package a;
    
    import java.util.Random;
    import java.util.Scanner;
    
    public class ma {
    
    	public static void main(String[] args) {
    		int a[] = new int[10];
    		Random r = new Random();
    		for (int i = 0; i < a.length; i++) {
    			a[i] = r.nextInt(100);
    		}
    		for (int i = 0; i < a.length - 1; i++) {
    			for (int n = 0; n < a.length - 1 - i; n++) {
    				if (a[n] > a[n + 1]) {
    					int c = a[n];
    					a[n] = a[n + 1];
    					a[n + 1] = c;
    				}
    			}
    
    		}
    		for (int x = 0; x < a.length; x++) {
    			System.out.println(a[x]);
    		}
    
    	}
    
    }
    

      

    package a;
    
    import java.util.Random;
    
    public class ma {
    
    	public static void main(String[] args) {
    		int a[] = new int[7];
    		Random r = new Random();
    		for (int i = 0; i < a.length; i++) {
    			a[i] = r.nextInt(35)+1;
    		}
    		for (int x = 0; x < a.length; x++) {
    			System.out.println(a[x]);
    		}
    
    	}
    
    }
    

      

    package a;
    
    public class ma {
    
    	public static void main(String[] args) {
    		int a[] = { 10, 20, 33, 34, 87, 90, 88, 9, 38, 44 }, q = 0;
    		int o = 0, max = a[0], min = a[0];
    		for (int i = 0; i < a.length; i++) {
    			if (a[i] % 2 == 0) {
    				o = o + 1;
    			} else {
    				q = q + 1;
    			}
    		}
    		for (int x = 0; x < a.length; x++) {
    			if (a[x] > max) {
    				max = a[x];
    			}
    		}
    		for (int y = 0; y < a.length; y++) {
    			if (a[y] < min) {
    				min = a[y];
    			}
    		}
    		System.out.println("最大值是" + max + ",最小值是" + min + ",奇数有" + q + "个,偶数有" + o + "个");
    	}
    }
    

      

  • 相关阅读:
    POJ_3104_Drying_(二分,最小化最大值)
    POJ_3273_Monthly_Expense_(二分,最小化最大值)
    POJ_3185_The_Water_Bowls_(反转)
    POJ_2566_Bound_Found_(尺取法+前缀和)
    POJ_3061_Subsequence_(尺取法)
    POJ_3258_River_Hopscotch_[NOIP2015]_(二分,最大化最小值)
    POJ_1064_Cable_master_(二分,假定一个解并判断是否可行)
    POJ_2456_Agressive_cows_(二分,最大化最小值)
    背包九讲之三(多重背包)
    背包九讲之二(完全背包)
  • 原文地址:https://www.cnblogs.com/hzpiou/p/12711598.html
Copyright © 2020-2023  润新知