题目1001:A+B for Matrices
来源:互联网 发布:怎么在淘宝开网店 编辑:程序博客网 时间:2024/05/16 13:01
#include<iostream>
using namespace std;
int main()
{
int N,M;
int *m,*n,*k;
while(cin>>M)
{
if (M ==0)break;
cin>>N;
int sum = 0,out = 0;
m = new int[M*N];
n = new int[M*N];
k = new int[M*N];
for (int i=0;i<M*N;i++)
{
cin>>m[i];
}
for (int i=0;i<M*N;i++)
{
cin>>n[i];
}
for (int i=0;i<M*N;i++)
{
k[i] = m[i]+n[i];
}
for(int i =0;i<M;i++)
{
for (int j=0;j<N;j++)
{
sum = sum + k[i*N+j];
}
if (sum ==0)
{
out = out+1;
}
else
sum = 0;
}
sum = 0;
for(int i =0;i<N;i++)
{
for (int j=0;j<M;j++)
{
sum = sum + k[i+j*N];
}
if (sum ==0)
{
out = out+1;
}
else
sum = 0;
}
cout<<out<<endl;
}
return 0;
}
using namespace std;
int main()
{
int N,M;
int *m,*n,*k;
while(cin>>M)
{
if (M ==0)break;
cin>>N;
int sum = 0,out = 0;
m = new int[M*N];
n = new int[M*N];
k = new int[M*N];
for (int i=0;i<M*N;i++)
{
cin>>m[i];
}
for (int i=0;i<M*N;i++)
{
cin>>n[i];
}
for (int i=0;i<M*N;i++)
{
k[i] = m[i]+n[i];
}
for(int i =0;i<M;i++)
{
for (int j=0;j<N;j++)
{
sum = sum + k[i*N+j];
}
if (sum ==0)
{
out = out+1;
}
else
sum = 0;
}
sum = 0;
for(int i =0;i<N;i++)
{
for (int j=0;j<M;j++)
{
sum = sum + k[i+j*N];
}
if (sum ==0)
{
out = out+1;
}
else
sum = 0;
}
cout<<out<<endl;
}
return 0;
}
0 0
- 题目1001:A+B for Matrices
- 题目1001:A+B for Matrices
- 题目1001:A+B for Matrices
- 题目1001:A+B for Matrices
- 题目1001:A+B for Matrices
- 题目1001:A+B for Matrices
- 题目1001:A+B for Matrices
- 题目1001:A+B for Matrices
- 题目1001:A+B for Matrices
- 题目1001:A+B for Matrices
- 题目1001:A+B for Matrices
- 题目1001:A+B for Matrices
- 题目1001:A+B for Matrices
- 题目1001: A+B for Matrices
- 题目1001:A+B for Matrices
- 题目1001:A+B for Matrices
- 题目1001:A+B for Matrices
- 题目1001:A+B for Matrices
- POSIX标准与目录管理
- 9个offer,12家公司,35场面试,从微软到谷歌,应届计算机毕业生的2012求职之路
- Maven 安装本地jar
- CocurrentHashMap和Hashtable的区别
- Linux用户空间与内核空间 (转)
- 题目1001:A+B for Matrices
- The New text file option missing in the new context menu
- Lucene4.0入门实例
- Lake Counting-DFS
- C++编程思想学习笔记---第五章 隐藏实现
- github初级使用
- 互联网技术架构的启示
- [面试经]字节对齐
- 虚函数和虚基类混合的情况