Sicily 1149. 等价表达式

     首先将中缀表达式转换为后缀表达式，然后通过枚举a的值判断两个表达式是否等价的，关于如何将中缀表达式转换为后缀表达式的问题，小兵的专栏(http://blog.csdn.net/bing_bing/archive/2010/12/05/6056876.aspx)有着详细的解释，同时本题还要注意的一点就是数据要用long long来存，在这里wa了好几次了。。

 

#include<stdio.h> #include<string.h> #include<ctype.h> #include<string> #include<stack> #include<math.h> #include<iostream> using namespace std; long long power(long long a, long long b) { long long ans = 1; for(int i = 0; i < b; i++) ans *= a; return ans; } bool prior(char stacktop, char input) { bool ret = true; switch(stacktop) { case '+': case '-': switch(input) { case '*': case '^': ret = false; break; } case '*': switch(input) { case '^': ret = false; break; } break; } return ret; } //中缀转为后缀 string infixToPostfix(string infix) { string postfix; stack<char> temp; for(int i = 0; i < infix.length(); i++) { if(infix[i] == ' ') continue; if(infix[i] == '(') temp.push(infix[i]); else if(infix[i] == ')') { while(!temp.empty() && temp.top() != '(') { postfix += temp.top(); temp.pop(); } temp.pop(); } else if(infix[i] == '+' || infix[i] == '-' || infix[i] == '*' || infix[i] == '^') { while(!temp.empty() && temp.top() != '(' && prior(temp.top(), infix[i])) { postfix += temp.top(); temp.pop(); } temp.push(infix[i]); } else { if(isdigit(infix[i])) { while(i < infix.length() && isdigit(infix[i])) { postfix += infix[i]; i++; } i--; postfix += "#"; //区别这个是常数 } else postfix += infix[i]; } } while(!temp.empty()) { postfix += temp.top(); temp.pop(); } return postfix; } long long calculate(string postfix, int num) { int len = postfix.length(); stack<long long> ans; for(int i = 0; i < len; i++) { if(postfix[i] == 'a') ans.push(num); else if(isdigit(postfix[i])) { long long tmp = 0; while(i < len && isdigit(postfix[i])) { tmp = tmp*10 + (postfix[i] - '0'); i++; } i--; ans.push(tmp); } else if(postfix[i] == '+') { long long tmp1 = ans.top(); ans.pop(); long long tmp2 = ans.top(); ans.pop(); ans.push(tmp1 + tmp2); } else if(postfix[i] == '-') { long long tmp1 = ans.top(); ans.pop(); long long tmp2 = ans.top(); ans.pop(); ans.push(tmp2 - tmp1); } else if(postfix[i] == '*') { long long tmp1 = ans.top(); ans.pop(); long long tmp2 = ans.top(); ans.pop(); ans.push(tmp1 * tmp2); } else if(postfix[i] == '^') { long long tmp1 = ans.top(); ans.pop(); long long tmp2 = ans.top(); ans.pop(); ans.push(power(tmp2, tmp1)); } } return ans.top(); } #define LOCAL int main() { #ifdef LOCAL freopen("input_soj1149.txt", "r", stdin); freopen("output_soj1149.txt", "w", stdout); #endif string infix; string postfix; getline(cin, infix); postfix = infixToPostfix(infix); string input; int n; cin >> n; getchar(); for(int i = 0; i < n; i++) { getline(cin, input); string output = infixToPostfix(input); int j; for(j = 0; j <= 1000; j++) { long long temp1 = calculate(postfix, j); long long temp2 = calculate(output, j); if(temp1 != temp2) break; } if(j > 1000) printf("%c", 'A'+i); } printf("/n"); return 0; }