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 <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

class Parsing {
public:
    using State = string::const_iterator;
private:
    class ParseError : std::exception {};
    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 number(State &begin) {  //??°???
        int ret = 0;
        while (isdigit(*begin)) {
            ret *= 10;
            ret += (*begin) - '0';
            begin++;
        }
        return ret;
    }
    int factor(State &begin) {  //?????????
        int ret = 0;
        if (*begin == '(') {
            begin++;
            ret += expression(begin);
            begin++;
        } else {
            ret += number(begin);
        }
        return ret;
    }
    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;
    }
public:
    Parsing() {}
    int getans(const string &s) {
        State itr = s.begin();
        int ans = 0;
        while (itr != s.end()) {
            ans += expression(itr);
        }
        return ans;
    }
};

void solve(int n) {
    Parsing ps;
    while (n--) {
        string s;
        cin >> s;
        s.pop_back();
        cout << ps.getans(s) << endl;
    }
    return;
}

signed main(void) {
    int n, m, p, a, b, c, x, y, z, q;
    string s;
    bool f = false;
    while (cin >> n) {
        solve(n);
        return 0;
    }
}

C++: #include <iostream>
#include <cmath>
#include <stack>
#include <algorithm>
#include <sstream>
using namespace std;
int hoge(string a)
{
	if(a=="(")return -1;
	if(a=="*"||a=="/")return 1;
	return 0;
}

long long calc(long long a,long long b,string str)
{
	if(str=="+")return a+b;
	if(str=="-")return a-b;
	if(str=="/")return a/b;
	if(str=="*")return a*b;
	
}

int main()
{
	int n;cin>>n;
	while(n--)
	{
		string str;cin>>str;
		stringstream ss;
		for(int i=0;i<str.size()-1;i++)
		{
			if(str[i]=='+'||str[i]=='-'||str[i]=='/'||str[i]=='*')ss<<" "<<str[i]<<" ";
			else if(str[i]=='(')ss<<"( ";
			else if(str[i]==')')ss<<" )";
			else ss<<str[i];
		}
		
		vector<string> v;
		stack<string> st;
		while(getline(ss,str,' '))
		{
			//if(str=="")continue;
			if(str=="+"||str=="-"||str=="/"||str=="*")
			{
				while(!st.empty()&&hoge(st.top())>hoge(str))
				{
					v.push_back(st.top());
					st.pop();
				}
				st.push(str);
			}
			else if(str==")")
			{
				while(st.top()!="(")
				{
					v.push_back(st.top());
					st.pop();
				}
				st.pop();
			}
			else if(str=="(")st.push(str);
			else v.push_back(str);
		}
		while(!st.empty())
		{
			v.push_back(st.top());
			st.pop();
		}
		stack<long long> k;
		for(int i=0;i<v.size();i++)
		{
			if(v[i]=="+"||v[i]=="-"||v[i]=="/"||v[i]=="*")
			{
				long long A,B;
				B=k.top();k.pop();
				A=k.top();k.pop();
				k.push(calc(A,B,v[i]));
			}
			else
			{
				k.push(atol(v[i].c_str()));
			}
		}
		cout<<k.top()<<endl;
	}
	
}

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

#define rep(i,n) for(int i=0;i<n;i++)


string foo2(string s){
	// cout<<"foo2 "<<s<<endl;
	bool f=true;
	rep(i,s.size()){
		if(i==0){
			if(s[0]=='-');
			else f=false;
		}
		else{
			if(s[i]>='0'&&s[i]<='9'){

			}
			else{
				f=false;
			}
		}
	}
	if(f) return s;
	// bool f=false;
	rep(i,s.size()){
		if(s[i]=='*'||s[i]=='/'){
			int xl=i,xr=i;
			f=true;
			while(1){
				if(xl==0) break;
				else if(s[xl-1]>='0'&&s[xl-1]<='9'){
					xl--;
				}
				else{
					
					break;
				}
			}
			while(1){
				if(xr==s.size()-1) break;
				else if(s[xr+1]>='0'&&s[xr+1]<='9'){
					xr++;
				}
				else{
					
					break;
				}
			}
			stringstream ss1,ss2;
			// cout<<s.substr(xl,xr-xl+1)<<endl;
			ss1<<s.substr(xl,xr-xl+1);
			int a,b;
			char t;
			ss1>>a;
			// cout<<"a "<<a<<endl;
			ss1>>t;
			ss1>>b;
			ss2<<s.substr(0,xl);
			int tt;
			if(t=='*'){
				tt=a*b;
			}
			else{
				tt=a/b;
			}
			ss2<<tt;
			if(xr<s.size()-1) ss2<<s.substr(xr+1);
			
			string tmp;
			ss2>>tmp;
			// cout<<"tmp "<<tmp<<endl;
			// cout<<"foo2 "<<s<<" "<<endl;
			return foo2(tmp);
		}
	}
	rep(i,s.size()){
		if(s[i]=='+'||s[i]=='-'){
			int xl=i,xr=i;
			f=true;
			while(1){
				if(xl==0) break;
				else if(s[xl-1]>='0'&&s[xl-1]<='9'){
					xl--;
				}
				else{
					break;
				}
			}
			while(1){
				if(xr==s.size()-1) break;
				else if(s[xr+1]>='0'&&s[xr+1]<='9'){
					xr++;
				}
				else{
					break;
				}
			}
			stringstream ss1,ss2;
			ss1<<s.substr(xl,xr-xl+1);
			int a,b;
			char t;
			ss1>>a;
			ss1>>t;
			ss1>>b;
			ss2<<s.substr(0,xl);
			int tt;
			if(t=='+'){
				tt=a+b;
			}
			else{
				tt=a-b;
				// cout<<tt<<endl;
			}
			ss2<<tt;
			if(xr<s.size()-1) ss2<<s.substr(xr+1);
			string tmp;
			ss2>>tmp;
			// cout<<"tmp "<<tmp<<endl;

			return foo2(tmp);
		}
	}
	return s;
}

string foo1(string s){
	// cout<<s<<endl;
	// string tmp="123456";
	// cout<<tmp.substr(5)<<endl;;
	int xl=-1,xr=-1;
	rep(i,s.size()){
		if(s[i]=='('){
			xl=i;
		}
		else if(s[i]==')'){
			xr=i;
			break;
		}
	}
	if(xr!=-1){
		// if(xr>=s.size()-1) return foo1(s.substr(0,xl)+s.substr(xl+1,xr-xl-1));
		if(xr<s.size()-1) return foo1(s.substr(0,xl)+foo2(s.substr(xl+1,xr-xl-1))+s.substr(xr+1));
		return foo1(s.substr(0,xl)+foo2(s.substr(xl+1,xr-xl-1)));
		// return foo1(s.substr(0,xl)+s.substr(xl+1,xr-xl-1)+s.substr(xr+1));
		
	}
	return foo2(s);
}

string solve(string s){
	return foo1(s);
}

int main(){
	int n;
	cin>>n;
	for(int i=0;i<n;i++){
		string s;
		cin>>s;
		// cout<<s.substr(0,0)<<endl;
		s=s.substr(0,s.size()-1);
		s=solve(s);
		cout<<s<<endl;
	}
}