-
题目描述:
-
This time, you are supposed to find A+B where A and B are two matrices, and then count the number of zero rows and columns.
-
输入:
-
The input consists of several test cases, each starts with a pair of positive integers M and N (≤10) which are the number of rows and columns of the matrices, respectively. Then 2*M lines follow, each contains N integers in [-100, 100], separated by a space. The first M lines correspond to the elements of A and the second M lines to that of B.
The input is terminated by a zero M and that case must NOT be processed.
-
输出:
-
For each test case you should output in one line the total number of zero rows and columns of A+B.
-
样例输入:
-
2 2 1 1 1 1 -1 -1 10 9 2 3 1 2 3 4 5 6 -1 -2 -3 -4 -5 -6 0
-
样例输出:
-
1 5
-
答疑:
- 解题遇到问题?分享解题心得?讨论本题请访问: http://t.jobdu.com/thread-7724-1-1.html
#include <iostream>
using namespace std;
int main()
{
int a,b,a1[10][10],a2[10][10],a3[10][10],count=0;
int i,j;
while(cin >> a && a!=0)
{
cin>>b;
count =0;
for(i=0;i<a;i++)
{
for(j=0;j<b;j++)
{
cin >> a1[i][j];
}
}
for(i=0;i<a;i++)
{
for(j=0;j<b;j++)
{
cin >> a2[i][j];
}
}
for(i=0;i<a;i++)
{
for(j=0;j<b;j++)
{
a3[i][j] = a1[i][j]+a2[i][j];
if(a3[i][j]==0)
continue;
else
break;
}
if(j==b)
count++;
}
for(j=0;j<b;j++)
{
for(i=0;i<a;i++)
{
a3[i][j] = a1[i][j]+a2[i][j];
if(a3[i][j]==0)
continue;
else
break;
}
if(i==a)
count++;
}
cout<<count<<endl;
}
return 0;
}
/**************************************************************
Problem: 1001
User: vhreal
Language: C++
Result: Accepted
Time:0 ms
Memory:1520 kb
****************************************************************/