當前位置：首頁 > 编程资源 > 编程问答 >内容正文

编程问答

题目1001：A+B for Matrices

發布時間：2025/3/15 编程问答 20 豆豆

生活随笔收集整理的這篇文章主要介紹了题目1001：A+B for Matrices 小編覺得挺不錯的,現在分享給大家,幫大家做個參考.

題目描述：

??? 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

樣例輸出：

思路：用輔助空間在第二個矩陣輸入的同時計算對應位置的和，并且計算 i行和 j列的對應的累加值。最后掃描，得到行列值為0的元素的個數。

code:

#include <bits/stdc++.h>using namespace std;int main(){int a[100][100] ;int m , n ;while (cin>>m && m!=0){cin>>n;for (int i = 0 ; i < m ; ++i){a[i][n] = 0 ;for (int j = 0 ; j <n ; ++j){a[m][j] = 0 ;cin>>a[i][j];}}int t ;for (int i = 0 ; i < m ; ++i){for (int j = 0 ; j <n ; ++j){cin>>t;a[i][j]+=t;a[i][n]+=a[i][j] ;a[m][j]+=a[i][j];}}int sum = 0;for (int i = 0 ; i < m ;++i)if (a[i][n] == 0 ) sum++;for (int j = 0 ; j < n ;++j)if (a[m][j] == 0 ) sum++;cout<<sum<<endl ;}return 0; }

總結

以上是生活随笔為你收集整理的题目1001：A+B for Matrices的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。

上一篇： mysql排行榜sql的实现
下一篇： vc:如何从Internet上有效而稳定