/
Grading Students.java
64 lines (53 loc) · 1.76 KB
/
Grading Students.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
import java.io.*;
import java.math.*;
import java.text.*;
import java.util.*;
import java.util.regex.*;
public class Solution {
/*
* Complete the gradingStudents function below.
*/
static int[] gradingStudents(int[] grades) {
int[] m = new int[grades.length];
for(int i=0;i<m.length;i++){
if(grades[i]>37){
switch(grades[i]%10){
case 3:
grades[i]+=2;
break;
case 4:
grades[i]+=1;
break;
case 8:
grades[i]+=2;
break;
case 9:
grades[i]+=1;
break;
default:
break;
}
}
}
return grades;
}
private static final Scanner scan = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bw = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int n = Integer.parseInt(scan.nextLine().trim());
int[] grades = new int[n];
for (int gradesItr = 0; gradesItr < n; gradesItr++) {
int gradesItem = Integer.parseInt(scan.nextLine().trim());
grades[gradesItr] = gradesItem;
}
int[] result = gradingStudents(grades);
for (int resultItr = 0; resultItr < result.length; resultItr++) {
bw.write(String.valueOf(result[resultItr]));
if (resultItr != result.length - 1) {
bw.write("\n");
}
}
bw.newLine();
bw.close();
}
}