程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> 關於C++ >> 九度OJ—題目1001:A+B for Matrices

九度OJ—題目1001:A+B for Matrices

編輯:關於C++
上一篇/kf/201412/363598.html
題目描述:

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
來源:
2011年浙江大學計算機及軟件工程研究生機試真題 答疑:
解題遇到問題?分享解題心得?討論本題請訪問:www.2cto.com

 

 

#include 
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> a1[i][j];
            }
        }
        for(i=0;i> a2[i][j];
            }
        }
        for(i=0;i

 

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved