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++: #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
#include <cctype>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

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

int number(State &begin);
int factor(State &begin);
int term(State &begin);
int factor(State &begin);

// ??°?????????????????????
int number(State &begin) {
    int ret = 0;
    while(isdigit(*begin)) {
        ret *= 10;
        ret += (*begin - '0');
        begin++;
    }
    return ret;
}

// ??¬??§?????°????????????
int factor(State &begin) {
    if(*begin == '(') {
        begin++; // '(' ????£???°???
        int ret = expression(begin);
        begin++; // ')' ????£???°???
        return ret;
    }
    else return number(begin);
}

// ??????????????????????????????
int term(State &begin) {
    // ????????????????????¨????????£????????°??????????????§???????????????
    // begin ?????????????????°?????§???????????????
    int ret = factor(begin);

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

    return ret;
}

// ??????????????????????????????
int expression(State &begin) {
    int ret = term(begin);
    while(1) {
        if(*begin == '+') {
            begin++;
            ret += term(begin);
        }
        else if(*begin == '-') {
            begin++;
            ret -= term(begin);
        }
        else break;
    }
    return ret;
}

signed main() {
    int N; cin >> N;
    rep(i,0,N) {
        string s; cin >> s;
        State begin = s.begin();
        int ans = expression(begin);
        cout << ans << endl;
    }
    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--){
    hand.push_back(string(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;
}