Problem D: 强悍的矩阵运算来了

Problem D: 强悍的矩阵运算来了

Time Limit: 1 Sec   Memory Limit: 128 MB
Submit: 1810   Solved: 1157
[ Submit][ Status][ Web Board]

Description

定义一个Matrix类，用于存储一个矩阵。重载其+、*运算符，分别用于计算两个矩阵的和、乘积；重载其<<和>>运算符，用于输出和输入一个矩阵。要求当两个矩阵不能进行加法或乘法运算时，应该输出Error。

Input

输入第1行N>0，表示有N组测试用例，共2N个矩阵。

每组测试用例包括2个矩阵。每个矩阵首先输入行数、列数，之后是该矩阵的所有元素。

Output

每个测试用例产生一组输出。具体格式见样例。注意：当不能进行加法或乘法运算时，应输出Error。

Sample Input

32 21 11 12 22 22 21 111 22 21 112 22 22 2

Sample Output

Case 1:3 33 34 44 4Case 2:Error2 2Case 3:ErrorError

HINT

Append Code

append.cc,

[ Submit][ Status][ Web Board]

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118

#include<bits/stdc++.h> using namespace std; class Matrix { private :      int s[110][110];      int l,v,flag; public :      Matrix()      {          flag=0;      }      Matrix operator + ( const Matrix &a)      {          Matrix b;          b.l=a.l;          b.v=a.v;          if (l!=a.l||v!=a.v)          {              b.flag=1;              return b;          }          for ( int i = 0; i<l; i++)          {              for ( int j=0; j<v; j++)              {                  b.s[i][j]=s[i][j]+a.s[i][j];              }          }          return b;      }      Matrix operator * (Matrix &a)      {           Matrix b;          b.l=l;          b.v=a.v;          for ( int i=0; i<b.l; i++)          {              for ( int j = 0; j<b.v; j++)              {                  b.s[i][j]=0;              }            }          if (v!=a.l)          {              b.flag = 1;              return b;          }          for ( int i=0; i<l; i++)          {              for ( int j=0; j<a.v; j++)              {                  int sum = 0;                  for ( int q=0; q<a.l; q++)                  {                      sum += s[i][q] * a.s[q][j];                  }                  b.s[i][j]  = sum;              }          }          return b;      }      friend istream &operator>>(istream &is,Matrix &a)      {          is>>a.l>>a.v;          for ( int i=0; i<a.l; i++)              {                  for ( int j=0; j<a.v; j++)              {                  is>>a.s[i][j];              }              }          return is;      }        friend ostream &operator<<(ostream &os,Matrix &a)      {          if (a.flag==1)          {              os<< "Error" <<endl;              return os;          }          for ( int i=0; i<a.l; i++)              for ( int j=0; j<a.v; j++)              {                  if (j!=a.v-1)                      os<<a.s[i][j]<< " " ;                  else                      os<<a.s[i][j]<<endl;              }          return os;      } }; int main() {      int cases, i;      cin>>cases;      for (i = 0; i < cases; i++)      {          Matrix A, B, C, D;          cin>>A>>B;          C = A + B;          D = A * B;          cout<< "Case " <<i + 1<< ":" <<endl;          cout<<C<<endl;          cout<<D;      }      return 0; }