It's simple problem;
The work you should do is calculate the GCD from A1 to An;
The portal:http://acm.tju.edu.cn/toj/showp4116.html
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
int gcd(int a1,int a2){
int temp;
while(a2){
temp = a1 % a2;
a1 = a2;
a2 = temp;
}
return a1;
}
int f[100005];
void Deal_with(){
int T;
scanf("%d",&T);
while(T--){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",f+i);
}
int ans = f[0];
for(int i=1;i<n;i++){
ans = gcd(ans,f[i]);
}
printf("%d\n",ans);
}
}
int main(void){
//freopen("a.in","r",stdin);
Deal_with();
return 0;
}