Sicily 1020. Big Integer

/*
大数求余，模拟手算 
*/
/*
Run Time: 0.04secs
Run Memory: 312KB
*/

#include <iostream>
#include <string>

using namespace std;

//大数求余 
int computMod(string longInt, int num){
    int ten = 0;
    
    for(int i=0; i<longInt.length(); i++){
        int buf = ten * 10 + (longInt[i]-'0');
        ten = buf % num;         
    } 
    return ten;
}

int main()
{
    int T;
    int N;
    int list[101];
    int mod[101];
    string longInt;
    cin >> T;
    while (T>0){
        cin >> N;
        for(int i=0; i<N; i++)
            cin >> list[i];
        cin >> longInt;
        
        for(int i=0; i<N; i++)
            mod[i] = computMod(longInt, list[i]);
            
        cout << "(";
        if(N != 0){
            cout << mod[0];
            for(int i=1; i<N; i++)
                cout << "," << mod[i];
        }
        cout << ")" << endl;
         
        T--;
    }

    return 0;
}