同餘模（模板）

     定理：  

  (a+b)mod n =  ((a mod n)+ (b mod n))mod n;

 (a-b) mod n = ((a mod n )- (b mod n)+n)mod n;

 ab mod n = (a mod n) (b mod n) mod n

include <iostream>  
#include <cstring>  
using namespace std;  
  
int main()  
{  
    int test,n,i,k,ans,temp;  
    int bas[106],res[106];  
    char oper[600];               //oper保存大數  
    cin>>test;  
    while(test--)  
    {  
        cin>>n;  
        for(i = 0;i < n;i++)       
            cin>>bas[i];  
        cin>>oper;  
        int len = strlen(oper);  
        for(k = 0;k < n;k++)  
        {  
            temp = bas[k],ans = 0;  
            for(i = 0;i < len;i++)     //這裏運用公式(a+b)%n = ((a%n)+(b%n))%n;  
                ans = (int)(((long)ans*10+(oper[i]-'0'))%temp);  
            res[k] = ans;  
        }  
        cout<<"("<<res[0];  
        for(i = 1;i < n;i++)  
            cout<<","<<res[i];  
        cout<<")"<<endl;  
    }  
    return 0;  
}