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 <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for( int i = 0; i < n; i++ )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000

int mul10 (int x, int y) {
    int ret = 1;
    for (int i = 0; i < x; i++) {
        ret *= 10;
    }
    ret *= y;
    return ret;
}

int cal (char sym, int x, int y) {
    if (sym == '+') {
        return x + y;
    } else if (sym == '*') {
        return x * y;
    } else if (sym == '-') {
        return x - y;
    } else if (sym == '/') {
        return x / y;
    }
}
int depth_parentheses (string str) {
    int count = 0;
    int count_max = 0;
    rep(i, str.length()) {
        if (str[i] == '(') count++;
        else if (str[i] == ')') count--;
        count_max = max(count_max, count);
    }
    return count_max;
}

int findL_parentheses (string str, int depth) {
    int L = 0;
    rep(i, str.length()) {
        if (str[i] == '(') L++;
        else if (str[i] == ')') L--;
        if (L == depth) {
            return i;
        }
    }
}

int findL_parentheses (string str) {
    int L = 0;
    int depth = depth_parentheses(str);
    rep(i, str.length()) {
        if (str[i] == '(') L++;
        else if (str[i] == ')') L--;
        if (L == depth) {
            return i;
        }
    }
}

int findR_parentheses (string str) {
    int R;
    int L = findL_parentheses(str);
    for (int i = L+1; i < str.length(); i++) {
        R = i;
        if (str[i] == ')') break;
    }
    return R;
}

int findR_parentheses (string str, int L) {
    int R;
    if (L == 0) L = findL_parentheses(str);
    for (int i = L+1; i < str.length(); i++) {
        R = i;
        if (str[i] == ')') break;
    }
    return R;
}
string takeout_parentheses (string str) {
    string ret;
    int depth = depth_parentheses(str);
    int L = findL_parentheses(str, depth);
    int R = findR_parentheses(str, L);
    //dump(depth);
    //dump(L);
    //dump(R);
    stringstream str_tmp;
    for (int i = L+1; i < R; i++) str_tmp << str[i];
    ret = str_tmp.str();
    return ret;
}

int find_muldiv (string str) {
    int sym = 1;
    while (str[sym] >= '0' && str[sym] <= '9' || str[sym] == '+' || str[sym] == '-') sym++;
    return sym;
}
int find_addsub (string str) {
    int sym = 1;
    while (str[sym] >= '0' && str[sym] <= '9') sym++;
    return sym;
}
string error_check(string str) {
    stringstream tmp;
    int flag = 0;
    //cout << str << endl;
    rep(i, str.length()-1) {
        if (str[i] == '+' && str[i+1] == '-') {
            i++;
            flag = 1;
        }
        tmp << str[i];
    }
    tmp << str[str.length()-1];
    if (flag == 0) return str;
    str = tmp.str();
    cout << str << endl;
    return str;
}

string cal_mul (string str, int sym) {
    error_check(str);
    if (sym == str.length()) return str;

    int L = 1, R = 1;
    int sumL = 0, sumR = 0;
    while (str[sym-L] >= '0' && str[sym-L] <= '9') {
        sumL += mul10(L-1, (str[sym-L] - '0'));
        L++;
    }
    //dump(sym - L);
    if (str[sym-L] == '-' && str[0] == '-') sumL = -sumL; 
    int flag = 0;
    if (str[sym+1] == '-') flag = 1;
    //dump(flag);
    while (str[sym+R+flag] >= '0' && str[sym+R+flag] <= '9') {
        R++;
    }
    //dump(L);
    //dump(R);
    rep(i ,R-1) {
        //dump(str[sym+R-i-1+flag]);
        sumR += mul10(i, str[sym+R-i-1+flag] - '0');
    }
    if (flag == 1) sumR = -sumR;
    //dump(sumL);
    //dump(sumR);
    stringstream str_tmp;
    //cout << str << endl;
    if (str[0] == '-') rep(i, sym-L) str_tmp << str[i+1];
    else rep(i, sym-L+1) str_tmp << str[i];
    str_tmp << cal(str[sym], sumL, sumR);
    for(int i = sym+R; i < str.length()-flag; i++) str_tmp << str[i];
    str = str_tmp.str();
    //cout << str << endl;
    return str;
}

string cal_all (string str) {
    string prev = str;
    while(true){
        str = cal_mul(str, find_muldiv(str));
        //cout << str << endl;
        if ( prev == str ) break;
        else prev = str;
    }
    while(true){
        str = cal_mul(str, find_addsub(str));
        if ( prev == str ) break;
        else prev = str;
    }
    return str;
}

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n; cin >> n;
    rep(i ,n){
        string str; cin >> str;
        str.erase( --str.end() );

        //?????£?????????????¨??????????
        while(depth_parentheses(str) > 0){
            string sube = takeout_parentheses(str);
            sube = cal_all(sube);

            int L = findL_parentheses(str);
            int R = findR_parentheses(str);
            stringstream str_tmp;
            rep(i, L) str_tmp << str[i];
            str_tmp << sube;
            for (int i = R+1; i < str.length(); i++) {
                str_tmp << str[i];
            }
            str = str_tmp.str();
            //cout << str << endl;
        }

        //?????£?????????????????¶?????§?¨??????????
        string prev = str;
        str = cal_all(str);
        //?????????????????????
        int ans = stoi(str);
        cout << str << endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

inline string sub(string str, int i) {
    return string(str.begin() + i + 1, str.end());
}

int dfs(string);
int get_num(string&, int&);

int get_num(string& str, int& i) {
    int num = 0;

    if (str[i] == '(') {
        string ss;
        i++;
        for (int count = 1; count; i++) {
            if (str[i] == '(') count++;
            if (str[i] == ')') count--;

            if (count) {
                ss += str[i];
            }
        }

        return dfs(ss);
    }

    for (; i < str.size(); i++) {
        if ('0' <= str[i] && str[i] <= '9') {
            num = num * 10 + (str[i] - '0');
        } else {
            return num;
        }
    }

    return num;
}

int dfs(string str) {
    int num = 0;

    int i = 0;

    if (str[i] == '-') {
        num = -1 * get_num(str, ++i);
    }

    if (str[0] == '(') {
        num = get_num(str, i);
    }

    for (; i < str.size(); i++) {
        if ('0' <= str[i] && str[i] <= '9') {
            num = num * 10 + (str[i] - '0');
        } else {
            if (str[i] == '*') {
                num = num * get_num(str, ++i);
            } else if (str[i] == '/') {
                num = num / get_num(str, ++i);
            } else if (str[i] == '+') {
                return num + dfs(sub(str, i));
            } else if (str[i] == '-') {
                return num - dfs(sub(str, i));
            } else {
                return num;
            }
        }
    }

    return num;
}

int main() {
    int N;
    cin >> N;
    while (N--) {
        string str;
        cin >> str;

        cout << dfs(str) << endl;
    }

    return 0;
}