zoukankan      html  css  js  c++  java
  • 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 + "个");
    	}
    }
    

      

  • 相关阅读:
    eclipse配置自动提示EXTJS和jQurey
    Java用jdom.jar解析读取XML文件信息
    Hibernate配置XML连接数据库
    【codeforces】ZeptoLab Code Rush 2015 E 跳跃表? D kmp还不错的题
    各种语言版本的输出本身源代码的程序
    原地归并排序
    c/c++ static
    【程序员的自我修养——链接、装载与库】笔记
    【清华大学OS公开课】
    学习需要记录才行啊
  • 原文地址:https://www.cnblogs.com/hzpiou/p/12711598.html
Copyright © 2011-2022 走看看