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<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef complex<double> C;

typedef string::const_iterator State;
int expression(State& begin);
int term(State& begin);
int number(State& begin);
int factor(State& begin);

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

int term(State& begin) {
    int ret = factor(begin);
    for (;;) {
        if (*begin == '*') {
            begin++;
            ret *= factor(begin);
        } else if (*begin == '/') {
            begin++;
            ret /= factor(begin);
        } else break;
    }
    return ret;
}

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

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

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    cin.ignore();
    for (int i = 0; i < n; i++) {
        string s;
        getline(cin, s);

        State begin = s.begin();
        int ans = expression(begin);
        cout << ans << endl;
    }
    return 0;
}

C++: #include "bits/stdc++.h"

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl

typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i,n) for(ll i=1;i<=(ll)(n);i++)
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define rrep1(i,n) for(ll i=(ll)(n);i>0;i--)
#define REP(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = 2e18;
const ll MOD = 1000000007;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);

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

ll number(State&);
ll factor(State&);
ll term(State&);
ll expression(State&);

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

ll factor(State &begin) {
    if (*begin == '(') {
        begin++; // '('を飛ばす。
        ll ret = expression(begin);
        begin++; // ')'を飛ばす。
    } else {
        return number(begin);
    }
}

ll term(State &begin) {
  ll ret = factor(begin);
  for (;;) {
    if (*begin == '*') {
      begin++;
      ret *= factor(begin);
    }
    else if (*begin == '/') {
      begin++;
      ret /= factor(begin);
    }
    else {
      break;
    }
  }
  return ret;
}

ll expression(State &begin) {
  ll ret = term(begin);
  for (;;) {
    if (*begin == '+') {
      begin++;
      ret += term(begin);
    }
    else if (*begin == '-') {
      begin++;
      ret -= term(begin);
    }
    else {
      break;
    }
  }
  return ret;
}


int main () {
  int n;
  cin >> n;
  cin.ignore();
  while (n--) {
    string s;
    getline(cin, s);
    State begin = s.begin();
    ll ans = expression(begin);
    cout << ans << endl;
  }
  
}

C++: #include<iostream>
#include<string>

using namespace std;

string s;
int parse(int l, int r){
  int k = 0;
 
  for(int i = r - 1; i >= l; i--){
    if(s[i] == ')') k++;
    if(s[i] == '(') k--;
    if(!k && s[i] == '+')return parse(l, i) + parse(i + 1, r);
    if(!k && s[i] == '-')return parse(l, i) - parse(i + 1, r);
  }
 
  for(int i = r - 1; i >= l; i--){
    if(s[i] == ')') k++;
    if(s[i] == '(') k--;
    if(!k && s[i] == '*')return parse(l, i) * parse(i + 1, r);
    if(!k && s[i] == '/')return parse(l, i) / parse(i + 1, r);
  }
 
  if(s[l] == '(' && s[r - 1] == ')')return parse(l + 1, r - 1);
 
  return stoi( s.substr(l, r - l) );
}
 
int main()
{
  int n;
  cin >> n;
  for(int i = 0; i < n; i++){
    cin >> s;
    cout << parse(0, (int)s.size() - 1) << endl;
  }
}

C++: #include<iostream>
#include<vector>
#include <string>
using namespace std;

int weak(string& s, int& i);
int strong(string& s, int& i);
int fc(string& s, int& i);
int inte(string& s, int& i);

int weak(string& s, int& i) {
	int buf = strong(s, i);
	while (s[i] == '+' || s[i] == '-') {
		if (s[i] == '+') {
			i++;
			buf += strong(s, i);
		}
		else {
			i++;
			buf -= strong(s, i);
		}
	}
	return buf;
}

int strong(string& s, int& i) {
	int buf = fc(s, i);
	while (s[i] == '*' || s[i] == '/') {
		if (s[i] == '*') {
			i++;
			buf *= fc(s, i);
		}
		else {
			i++;
			buf /= fc(s, i);
		}
	}
	return buf;
}

int fc(string& s, int& i) {
	if ('0' <= s[i] && '9' >= s[i])return inte(s, i);
	else {
		i++;
		int re = weak(s, i);
		i++;
		return re;
	}
}

int inte(string& s, int& i) {
	int buf = s[i] - '0';
	i++;
	while ('0' <= s[i] && '9' >= s[i]) {
		buf = buf * 10 + s[i];
		i++;
	}
	return buf;
}

int main() {
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		string s; int j = 0;
		cin >> s;
		cout << weak(s, j) << endl;
	}
}