Go: package main

import (
	"bufio"
	"fmt"
	"go/token"
	"go/types"
	"os"
	"strconv"
	"strings"
)

func main() {
	stdin := bufio.NewScanner(os.Stdin)
	stdin.Scan()
	n, _ := strconv.Atoi(stdin.Text())
	for i := 0; i < n; i++ {
		stdin.Scan()
		exp := strings.TrimRight(stdin.Text(), "=")
		res, _ := types.Eval(token.NewFileSet(), nil, token.NoPos, exp)
		fmt.Println(res.Value)
	}
}

C++: #define _USE_MATH_DEFINES
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<climits>
#include<string>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<cstring>
#include<stack>
using namespace std;

int p;
string S;

int num();
int factor();
int term();
int calc();

int num(){
	int n = 0;
	while(p<S.size()-1){
		if(isdigit(S[p])) n = n*10+S[p]-'0';
		else break;
		p++;
	}
	return n;
}

int factor(){
	int n;
	if(S[p]=='('){
		p++; n = calc(); p++;
	}
	else n = num();
	return n;
}

int term(){;
	int n = factor();
	while(p<S.size()-1){
		if(S[p]=='*') p++, n *= factor();
		else if(S[p]=='/') p++, n /= factor();
		else break;
	}
	return n;
}

int calc(){
	int n = term();
	while(p<S.size()-1){
		if(S[p]=='+') p++, n += term();
		else if(S[p]=='-') p++, n -= term();
		else break;
	}
	return n;
}

int main(){
	int N;
	cin>>N;
	for(int i=0;i<N;i++){
		cin>>S;
		p = 0;
		printf("%d\n",calc());
	}
	return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <stack>
#include <vector>
#include <stdio.h>

using namespace std;

int getPriority(char ch){
  switch(ch){
  case '+':
    return 0;
  case '-':
    return 1;
  case '*':
    return 2;
  case '/':
    return 3;
  default:
    return -1;
  }
}

vector<string> toReversePorland(string str){

  vector<string> hand;
  vector<string> side;
  
  for(int i = 0; i < str.size(); i++){
    if(str[i] == ' ')
      continue;
    else if(str[i] == '=')
      break;
    if(str[i] >= '0' && str[i] <= '9'){
      string num;
      while(i < str.size()){
	if(str[i] < '0' || str[i] > '9'){
	  break;
	}
	num += str[i];
	i++;
      }
      hand.push_back(num);
      i--;
    }
    else if(str[i] == '('){
      string tmp;
      tmp += str[i];
      side.push_back(tmp);
    }
    else if(str[i] == ')'){
      // ツ右ツ環古環づ慊づ可可算ツ子ツづーツ暗ェツづつつクツづつ偲ィツ個ウツづ可姪淞つキ
      for(int j = side.size()-1 ; ;j--){
	if(side[j] == "("){
	  if(j != 0){
	    vector<string> tmp;
	    for(int k = 0; k < j; k++){
	      tmp.push_back(side[k]);
	    }
	    side = tmp;
	  }
	  else
	    side.clear();
	  break;
	}
	else{
	  string tmp = side[j];
	  hand.push_back(tmp);
	}
      }
    }
    else{
      if(side.size() == 0){
	string tmp;
	tmp += str[i];
	side.push_back(tmp);
      }
      else{
	char cs = side[side.size()-1][0];
	if(cs != '+' && cs != '-' && cs != '*' && cs != '/'){
	  string tmp;
	  tmp += str[i];
	  side.push_back(tmp);
	}
	else{
	  if(getPriority(str[i]) < getPriority(cs)){
	    hand.push_back(side[side.size()-1]);
	    string tmp;
	    tmp += str[i];
	    side[side.size()-1] = tmp;
	  }
	  else{
	    string tmp;
	    tmp += str[i];
	    side.push_back(tmp);
	  }
	}
      }
      
      // else if(str[i] == '+' || str[i] == '-'){
      // 	if(side[side.size()-1] == "*" || side[side.size()-1] == "/"){
      // 	  hand.push_back(side[side.size()-1]);
      // 	  string tmp;
      // 	  tmp += str[i];
      // 	  side[side.size()-1] = tmp;
      // 	}
      // 	else{
      // 	  string tmp;
      // 	  tmp += str[i];
      // 	  side.push_back(tmp);
      // 	}
      // }
      // else{
      // 	if(side[side.size()-1] == "*" || side[side.size()-1] == "/"){
      // 	  hand.push_back(side[side.size()-1]);
      // 	  string tmp;
      // 	  tmp += str[i];
      // 	  side[side.size()-1] = string(tmp);
      // 	}
      // 	else{
      // 	  string tmp;
      // 	  tmp += str[i];
      // 	  side.push_back(tmp);
      // 	}
      // }
    }
  }

  for(int i = side.size()-1; i >= 0; i--){
    string tmp;
    //    tmp += side[i];
    hand.push_back(side[i]);
  }
  
  return hand;
}


long long calc(vector<string> str){
  stack<long long> st;
  for(int i = 0; i < str.size(); i++){
    if(str[i] == "+" || str[i] == "-" || str[i] == "*" || str[i] == "/"){
      int val[2];
      val[0] = st.top();
      st.pop();
      val[1] = st.top();
      st.pop();
      if(str[i] == "+"){
	st.push(val[0] + val[1]);
      }
      if(str[i] == "-"){
	st.push(val[1] - val[0]);
      }
      if(str[i] == "*"){
	st.push(val[0] * val[1]);
      }
      if(str[i] == "/"){
	st.push(val[1] / val[0]);
      }
    }
    else{
      st.push(atoi(str[i].c_str()));
    }
  }
  return st.top();
}

int main(){

  int n;
  string s;
  //  getline(cin,s);
  //  n = atoi(s.c_str());
  cin >> n;
    //  scanf("%d\n",&n);
  
  vector<string> input;
  string str;
  for(int i = 0; i < n; i++){
    //  getline(cin,str);
    cin >> str;
    input.push_back(str);
  }

  for(int i = 0; i < n; i++){
    str = input[i];
    // vector<string> vec = toReversePorland(str);
    // for(int i = 0; i < vec.size(); i++)
    //   cout << vec[i] << endl;
    cout << calc(toReversePorland(str)) << endl;
  }
  
  return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
#include <iomanip>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

class CalcExpression
{
	typedef string::const_iterator State;
	class ParseError {};


public:

	int expression(State& begin)
	{
		int ret = term(begin);

		while(true)
		{
			if(*begin == '+')
			{
				begin++;
				ret += term(begin);
			}
			else if(*begin == '-')
			{
				begin++;
				ret -= term(begin);
			}
			else break;
		}

		return ret;
	}


private:

	int term(State& begin)
	{
		int ret = factor(begin);

		while(true)
		{
			if(*begin == '*')
			{
				begin++;
				ret *= factor(begin);
			}
			else if(*begin == '/')
			{
				begin++;
				ret /= factor(begin);
			}
			else break;
		}

		return ret;
	}

	int factor(State &begin)
	{
		int ret = 0;

		if(*begin == '(')
		{
			begin++;
			ret = expression(begin);
			begin++;
		}
		else return number(begin);

		return ret;
	}

	int number(State& begin)
	{
		int ret = 0;

		while(isdigit(*begin))
		{
			ret *= 10;
			ret += *begin - '0';
			begin++;
		}

		return ret;
	}

};

int main()
{
	int n;
	cin >> n;

	CalcExpression ce;
	while(n--)
	{
		string expression, buf;

		cin >> expression;
		string::const_iterator it = expression.begin();

		cout << ce.expression(it) << endl;
	}
}