九度oj1001题

计算两个m行n列矩阵相加后，共有几行几列全为零，

#include"iostream"

#include"stdio.h"

using namespace std;

void add(int a[10][10], int b[10][10], int m, int n)

{

    for (int i = 0; i < m; i++)

    {

        for (int j = 0; j < n; j++)

            a[i][j] = a[i][j] + b[i][j];

    }

}

int count(int a[10][10], int m, int n)

{

    int count0 = 0;

    int count_m = 0, count_n = 0;

    for (int i = 0; i < m; i++)

    {

        for (int j = 0; j < n; j++)

        {

            if (a[i][j] == 0)

                count_n++;

        }

        if (count_n == n)

        {

            count0++;

 

        }

        count_n = 0;

    }

    for (int i = 0; i < n; i++)

    {

        for (int j = 0; j < m; j++)

        {

            if (a[j][i] == 0)

                count_m++;

        }

        if (count_m == m)

        {

            count0++;

 

        }

        count_m = 0;

    }

    return count0;

}

int main( )

{

    int a[10][10] = {0}, b[10][10] = { 0};

    int m, n;

    while (cin >> m >> n)

    {

        for (int i = 0; i < m; i++)

        {

            for (int j = 0; j < n; j++)

                cin >> a[i][j];

        }

        for (int i = 0; i < m; i++)

        {

            for (int j = 0; j < n; j++)

                cin >> b[i][j];

        }

        add(a, b, m, n);

        cout << count(a, m, n) << endl;

    }

    return 0;

}