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<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#include<typeinfo>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
//#define int ll
typedef int Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
//#define mt make_tuple
//typedef tuple<pii,int,int> tp;
//typedef vector<tp> vt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
//template<class C>constexpr int size(const C &c){return (int)c.size();}
//template<class T,size_t N> constexpr int size(const T (&xs)[N])noexcept{return (int)N;}
const double PI=acos(-1);
const double EPS=1e-7;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
typedef string::const_iterator State;
Def expr(string& s,State &i);
Def term(string& s,State &i);
Def factor(string& s,State &i);
Def number(string& s,State &i);
void consume(State &i,char expected){
	if(*i==expected)i++;
	else{
		cerr<<"!"<<endl;
	}
}
Def expr(string& s,State &i){
	Def out=term(s,i);
	while(*i=='+'||*i=='-'){
		char op=*i;
		i++;
		Def out1=term(s,i);
		if(op=='+')out+=out1;
		else out-=out1;
	}
	return out;
}
Def term(string& s,State &i){
	Def out=factor(s,i);
	while(*i=='*'||*i=='/'){
		char op=*i;
		i++;
		Def out1=factor(s,i);
		if(op=='*')out*=out1;
		else out/=out1;
	}
	return out;
}
Def factor(string& s,State &i){
	if(isdigit(*i))return number(s,i);
	//'('
	i++;
	Def out=expr(s,i);
	i++;
	return out;
}
Def number(string& s,State &i){
	Def out=0;
	while(isdigit(*i))out=out*10+*(i++)-'0';
	return out;
}
int main(){
	int n;
	cin>>n;
	while(n--){
		string s;
		cin>>s;
		cout<<expr(s,s.begin())<<endl;
	}
}

C++: #include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
typedef string::const_iterator state;

const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
const int Mod = 1000000000 + 0;
//{{{ templates
#define TT_ template<typename T>inline
#define TTF_ template<typename T,typename F>inline
TT_ T sq(T x){return x*x;}
TT_ T In(){T x;cin>>x;return x;}
TT_ void Out(T&x){cout<<x;}
TT_ void sort(T&v){sort(begin(v),end(v));}
TT_ void revs(T&v){reverse(begin(v),end(v));}
TT_ void uniq(T&v){sort(v);v.erase(unique(begin(v),end(v)),end(v));}
TT_ int ubnd(T&v,typename T::value_type&x){return upper_bound(begin(v),end(v),x)-begin(v);}
TT_ int lbnd(T&v,typename T::value_type&x){return lower_bound(begin(v),end(v),x)-begin(v);}
TTF_ void inpt(T&v,int n,F f){for(v.reserve(n);n--;v.emplace_back(f()));}
TTF_ void show(T&v,F f,string d=" ",string e="\n"){int i=0;for(auto&x:v)i++&&(cout<<d),f(x);cout<<e;}
TT_ typename T::iterator minel(T&v){return min_element(begin(v),end(v));}
TT_ typename T::iterator maxel(T&v){return max_element(begin(v),end(v));}

inline void fast_io(){ios::sync_with_stdio(0);cin.tie(0);}
inline int in(){int x;scanf("%d",&x);return x;}
inline ll pow_mod(ll a,ll k,ll m){ll r=1;for(;k>0;a=a*a%m,k>>=1)if(k&1)r=r*a%m;return r;}
inline ll mod_inv(ll a,ll p){return pow_mod(a,p-2,p);}
//}}} priority_queue queue deque front stringstream max_element min_element insert count make_tuple

template<typename T, bool Check=false>
struct LexParser {
  typedef T expr_t;
  typedef string::const_iterator state_t;
  LexParser(){}
  expr_t eval(const string& expr){
    auto s = begin(expr);
    auto r = expression(s);
    consume(s, '=');
    return r;
  }
  void consume(state_t& s, char expected){
    if (!Check || *s == expected){
      s++;
      return;
    }
    cerr << "Expected '" << expected << "' but got '" << *s << "'" << endl;
    cerr << "Rest string is '";
    while (*s) cerr << *s;
    cerr << "'" << endl;
  }
  expr_t number(state_t& s){
    expr_t r = 0;
    while (isdigit(*s)){
      r = r * 10 + (*s - '0');
      s++;
    }
    return r;
  }
  expr_t term(state_t& s){
    expr_t r = factor(s);
    while (1){
      if (*s == '*'){
        consume(s, '*');
        r *= factor(s);
      }
      else if (*s == '/'){
        consume(s, '/');
        r /= factor(s);
      }
      else break;
    }
    return r;
  }
  expr_t factor(state_t& s){
    expr_t r;
    if (*s == '('){
      consume(s, '(');
      r = expression(s);
      consume(s, ')');
    }
    else r = number(s);
    return r;
  }
  expr_t expression(state_t& s){
    expr_t r = term(s);
    while (1){
      if (*s == '+'){
        consume(s, '+');
        r += term(s);
      }
      else if (*s == '-'){
        consume(s, '-');
        r -= term(s);
      }
      else break;
    }
    return r;
  }
};

int main()
{
  LexParser<int> parser;
  for (int n = in(); n--;){
    string expr;
    cin >> expr;
    cout << parser.eval(expr) << endl;
  }
  return 0;
}