求平均成绩
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 59248 Accepted Submission(s): 14178
Problem Description
假设一个班有n(n<=50)个学生,每人考m(m<=5)门课,求每个学生的平均成绩和每门课的平均成绩,并输出各科成绩均大于等于平均成绩的学生数量。
Input
输入数据有多个测试实例,每个测试实例的第一行包括两个整数n和m,分别表示学生数和课程数。然后是n行数据,每行包括m个整数(即:考试分数)。
Output
对于每个测试实例,输出3行数据,第一行包含n个数据,表示n个学生的平均成绩,结果保留两位小数;第二行包含m个数据,表示m门课的平均成绩,结果保留两位小数;第三行是一个整数,表示该班级中各科成绩均大于等于平均成绩的学生数量。
每个测试实例后面跟一个空行。
Sample Input
2 2
5 10
10 20
Sample Output
7.50 15.00
7.50 15.00
1
分析
这道题很简单,没有什么高深的技巧。但是我接连做了两三天才通过,下面是我的两段源码,在杭电acm的在线评测系统上,“算法代码1”正确可以通过,“算法代码2”错误通不过。
这两段源码除了“保留两位小数”的方法不同外,其他的都一样,我不明白为什么“源码2”就通不过?如果有谁知道为什么请告诉我,在此先谢过了!
算法代码1:Accepted
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
while (scanner.hasNext()) {
int n = scanner.nextInt();
int m = scanner.nextInt();
int[][] sc = new int[n][m];
double[] savg = new double[n];
double[] cavg = new double[m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
sc[i][j] = scanner.nextInt();
savg[i] += sc[i][j];
cavg[j] += sc[i][j];
}
savg[i] /= m;
}
for (int i = 0; i < m; i++) cavg[i] /= n;
for (int i = 0; i < n - 1; i++) System.out.printf("%.2f ", savg[i]);
System.out.printf("%.2f\r\n", savg[n - 1]);
for (int i = 0; i < m - 1; i++) System.out.printf("%.2f ", cavg[i]);
System.out.printf("%.2f\r\n", cavg[m - 1]);
int snum = 0, flag = -1;
for (int i = 0; i < n; i++) {
flag = 1;
for (int j = 0; j < m; j++) {
if (sc[i][j] < cavg[j]) {
flag = 0;
break;
}
}
if (flag == 1) snum++;
}
System.out.printf("%d\r\n\r\n", snum);
}
}
}
算法代码2:Wrong Answer
import java.text.DecimalFormat;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
DecimalFormat df = new DecimalFormat("0.00");
Scanner scanner = new Scanner(System.in);
while (scanner.hasNext()) {
int n = scanner.nextInt();
int m = scanner.nextInt();
int[][] sc = new int[n][m];
double[] savg = new double[n];
double[] cavg = new double[m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
sc[i][j] = scanner.nextInt();
savg[i] += sc[i][j];
cavg[j] += sc[i][j];
}
savg[i] /= m;
}
for (int i = 0; i < m; i++) cavg[i] /= n;
for (int i = 0; i < n - 1; i++) System.out.print(df.format(savg[i]) + " ");
System.out.println(df.format(savg[n - 1]));
for (int i = 0; i < m - 1; i++) System.out.print(df.format(cavg[i]) + " ");
System.out.println(df.format(cavg[m - 1]));
int snum = 0, flag = -1;
for (int i = 0; i < n; i++) {
flag = 1;
for (int j = 0; j < m; j++) {
if (sc[i][j] < cavg[j]) {
flag = 0;
break;
}
}
if (flag == 1) snum++;
}
System.out.println(snum);
System.out.println();
}
}
}