zoukankan      html  css  js  c++  java
  • 从键盘输入成绩,找出最高分,并输出学生成绩等级。成绩>=最高分-10,为A,成绩>=最高分-20,为B,成绩>=最高分-30,为C,其余等级为D

    import java.util.Scanner;
    public class TestStudent {
    public static void main(String[] args) {
    //从键盘获得数据
    Scanner scan = new Scanner(System.in);
    //输入学生个数
    System.out.println("请输入学生个数:");
    int maxGrade=0;
    int count = scan.nextInt();
    //确定成绩个数,并用数组保存
    int[] score = new int[count];
    for(int i=0;i<score.length;i++){
    //从键盘获得成绩
    int grade = scan.nextInt();
    //把取得的成绩放在数组中
    score[i] = grade;
    //比较数组中值得大小
    if(score[i] > maxGrade){
    //获得最大值
    maxGrade = score[i];
    }

    }
    //输出最大值
    System.out.println("maxGrade为"+maxGrade);
    //遍历成绩,并且给成绩划分等级
    for(int i=0;i<score.length;i++){
    char leavl;
    if(score[i]>=maxGrade-10){
    leavl = 'A';
    }
    else if(score[i]>=maxGrade-20){
    leavl = 'B';
    }
    else if(score[i]>=maxGrade-30){
    leavl = 'C';
    }
    else{
    leavl = 'D';
    }
    //输出对应的学生学号,成绩和等级
    System.out.println("student为"+i+",score为"+score[i]+",leavl为"+leavl);
    }

    }

    }

  • 相关阅读:
    那些年伴我一起成长的SAP装备
    1079. Total Sales of Supply Chain (25)
    1132. Cut Integer (20)
    1074. Reversing Linked List (25)
    1071. Speech Patterns (25)
    1070. Mooncake (25)
    1067. Sort with Swap(0,*) (25)
    1063. Set Similarity (25)
    1066. Root of AVL Tree (25)
    1059. Prime Factors (25)
  • 原文地址:https://www.cnblogs.com/caocx/p/5710375.html
Copyright © 2011-2022 走看看