求解一道acm题

import java.text.DecimalFormat;
import java.util.Arrays;
import java.util.Scanner;

public class Main{
    public static void main(String[]args){
        Scanner cin=new Scanner(System.in);
        DecimalFormat df=new DecimalFormat("0.00");
        while(cin.hasNext()){
            int n=cin.nextInt();
            int m=cin.nextInt();
            int[][]a=new int[n][m];
            int[]b=new int[n];
            int[]c=new int[m];
            Arrays.fill(b,0);
            Arrays.fill(c,0);
            for(int i=0;i<n;i++){
                for(int j=0;j<m;j++){
                    a[i][j]=cin.nextInt();
                    b[i]+=a[i][j];
                    c[j]+=a[i][j];
                }
            }
            for(int i=0;i<n;i++){
                if(i==n-1)
                    System.out.println(df.format(1.0*b[i]/m)+" ");
                else
                    System.out.print(df.format(1.0*b[i]/m)+" ");
            }
            for(int i=0;i<m;i++){
                if(i==m-1)
                    System.out.println(df.format(1.0*c[i]/n)+" ");
                else
                    System.out.print(df.format(1.0*c[i]/n)+" ");
            }
            int t=0;
            for(int i=0;i<n;i++){
                int d=1;
                for(int j=0;j<m;j++){
                    if(a[i][j]<1.0*c[j]/n){
                        d=0;
                        break;
                    }
                }
                if(d==1)t++;

            }
            System.out.println(t+"\n");
        }
    }
}

#include <stdio.h>
#include <string.h>

int main(void)
{
    int n, m;
    int i, j;
    int t, d;
    int s[50];
    int c[5];
    int sc[50][5];

    while (scanf("%d%d", &n, &m) != EOF)
    {
        memset(s, 0, sizeof(s));
        memset(c, 0, sizeof(c));
        memset(sc, 0, sizeof(sc));
        for (i = 0 ; i < n ; i++)
        {
            for (j = 0 ; j < m ; j++)
            {
                scanf("%d", &sc[i][j]);
                c[j] += sc[i][j];
                s[i] += sc[i][j];
            }
        }
        for (i = 0 ; i < n ; i++)
            printf("%.2lf%c", s[i] * 1.0 / m, i < n - 1 ? ' ' : ' \n');
        for (i = 0 ; i < m ; i++)
            printf("%.2lf%c", c[i] * 1.0 / n, i < m - 1 ? ' ' : ' \n');
        for (t = i = 0 ; i < n ; i++)
        {
            for (d = 1, j = 0 ; j < m ; j++)
            {
                if (sc[i][j] < 1.0 * c[j] / n)
                {
                    d = 0;
                    break;
                }
            }
            if (d) t++;
        }
        printf("%d\n\n", t);
    }

    return 0;
}