Jobdu - 1001-A+B for Matrices | Acm之家

九度-1001-A+B for Matrices | Acm之家

    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.

int main(int argc, char **argv)

10

{

11	int i, j, m, n, nresult;

12

13	while (EOF != scanf("%d", &m) && m)

14

{

15	memset(res, 0, sizeof(res));

16	nresult = 0;

17	scanf("%d", &n);

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

19

{

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

21

{

22	scanf("%d", &matrix[0][i][j]);

23

}

24

}

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

26

{

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

28

{

29	scanf("%d", &matrix[1][i][j]);

30	matrix[1][i][j] += matrix[0][i][j];

31	if (matrix[1][i][j])

32

{

33	res[i] = res[m + j] = 1;

34

}

35

}

36

}

37	for (i = 0; i < m + n; ++i)

38

{

39	if (!res[i])

40

{

41	++nresult;

42

}

43

}

44	printf("%d\n", nresult);

45

}

46

return 0;

47

}

http://blog.csdn.net/sjf0115/article/details/7686447

1.     while(scanf("%d",&M),M){  
2.         scanf("%d",&N);  
3.         int i,j;  
4.         for(i = 0;i<M;i++){  
5.             for(j = 0;j<N;j++){  
6.                 scanf("%d",&Matrices[i][j]);  
7.             }  
8.         }  
9.         int a;  
10.         int count = 0;  
11.         int CountOfZero = 0;  
12.         for(i = 0;i<M;i++){  
13.             for(j = 0;j<N;j++){  
14.                 scanf("%d",&a);  
15.                 Matrices[i][j] += a;  
16.                 count += Matrices[i][j];  
17.             }  
18.             if(count == 0){  
19.                 CountOfZero++;  
20.             }  
21.             count = 0;  
22.         }  
23.         //计算列  
24.         count = 0;  
25.         for(i = 0;i<N;i++){  
26.             for(j = 0;j<M;j++){  
27.                 count += Matrices[j][i];  
28.             }  
29.             if(count == 0){  
30.                 CountOfZero++;  
31.             }  
32.             count = 0;  
33.         }  
34.         printf("%d\n",CountOfZero);  
35.     }  

Read full article from 九度-1001-A+B for Matrices | Acm之家