#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define LL long long
using namespace std;
int t,n,s[10005];
int gcd(int a,int b)
{
if(b==0) return a;
return gcd(b,a%b);
}
int main()
{
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&s[i]);
for(int i=3;i<=n;i++) s[2]/=gcd(s[2],s[i]);
s[2]/=gcd(s[2],s[1]);
if(s[2]==1) puts("Yes");
else puts("No");
}
return 0;
}
原文:https://www.cnblogs.com/Hawking-llfz/p/11545489.html