题目1001:A+B for Matrices
时间限制:1 秒
内存限制:32 兆
特殊判题:否
提交:12563
解决:5118
-
题目描述:
-
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
-
代码:
#include<stdio.h>
int main()
{
int m,n,sum=0,temp,count=0,i,j;
while(1)
{
scanf("%d",&m);
if(m==0) break;
scanf("%d",&n);
int matrix[m][n];
count=0;
for(i=0;i<m;i++)
for(j=0;j<n;j++)
scanf("%d",&matrix[i][j]);
for(i=0;i<m;i++)
for(j=0;j<n;j++)
{
scanf("%d",&temp);
matrix[i][j]+=temp;
}
for(i=0;i<m;i++)
{
sum=0;
for(j=0;j<n;j++)
sum+=matrix[i][j];
if(sum==0)
count++;
}
for(i=0;i<n;i++)
{
sum=0;
for(j=0;j<m;j++)
sum+=matrix[j][i];
if(sum==0)
count++;
}
printf("%d\n",count);
}
return 0;
}