Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose.
For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C).
The first one takes 15000 elementary multiplications, but the second one only 3500.
Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy.
Input Specification
Input consists of two parts: a list of matrices and a list of expressions.
The first line of the input file contains one integer n ( ), representing the number of matrices in the first part. The next n lines each contain one capital letter, specifying the name of the matrix, and two integers, specifying the number of rows and columns of the matrix.
The second part of the input file strictly adheres to the following syntax (given in EBNF):
SecondPart = Line { Line } <EOF> Line = Expression <CR> Expression = Matrix | "(" Expression Expression ")" Matrix = "A" | "B" | "C" | ... | "X" | "Y" | "Z"
Output Specification
For each expression found in the second part of the input file, print one line containing the word "error" if evaluation of the expression leads to an error due to non-matching matrices. Otherwise print one line containing the number of elementary multiplications needed to evaluate the expression in the way specified by the parentheses.
Sample Input
9 A 50 10 B 10 20 C 20 5 D 30 35 E 35 15 F 15 5 G 5 10 H 10 20 I 20 25 A B C (AA) (AB) (AC) (A(BC)) ((AB)C) (((((DE)F)G)H)I) (D(E(F(G(HI))))) ((D(EF))((GH)I))
Sample Output
0 0 0 error 10000 error 3500 15000 40500 4750015125
题意:求矩阵相乘次数,若无法相乘,则输出error
假设A是m*n矩阵,B是n*p矩阵,则AB是m*p矩阵,乘法次数为m*n*p,若A的列不等于B的行,则无法相乘;
例如,A是10*20,B是20*10,C是10*5,则(A(BC))的乘法次数为20*10*5(BC的乘法次数)+10*20*5(A(BC)乘法次数);
这题主要就是解析表达式,利用栈,遍历表达式,是字母则入栈,是右括号则出栈计算,结果再入栈;
代码如下:
#include <iostream> #include <string> #include <cstdio> #include <stack> using namespace std; /* run this program using the console pauser or add your own getch, system("pause") or input loop */ struct Matrix{//存放矩阵行和列 int row,col; Matrix(int a=0,int b=0):row(a),col(b) { } }mat[26]; stack<Matrix> s; int main(int argc, char** argv) { int n; scanf("%d%*c",&n);//因为接下来输入的是字符,所以要吃掉最后的换行符 for(int i=0;i<n;i++) { char ch; scanf("%c",&ch); scanf("%d%d%*c",&mat[ch-'A'].row,&mat[ch-'A'].col);//用%*c吃掉最后的回车 } string str; while(cin>>str) { int len=str.length(); int flag=1; int sum=0; for(int i=0;i<len;i++) { if(isalpha(str[i])) { s.push(mat[str[i]-'A']); } else if(str[i]==')') { Matrix m2=s.top();s.pop(); Matrix m1=s.top();s.pop(); if(m1.col!=m2.row) { flag=0;break; } sum+=m1.col*m1.row*m2.col; s.push(Matrix(m1.row,m2.col)); } } if(flag) printf("%d\n",sum); else printf("error\n"); } return 0; }