尽然看一道入门题看了这么久...
可以想见除了第一个数在上面 第二个数固定在下面 其他数可以任意
那么就只留第二个数在下面
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;
inline char nc(){
static char buf[100000],*p1=buf,*p2=buf;
if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
return *p1++;
}
inline void read(ll &x){
char c=nc(),b=1;
for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}
int main(){
ll T,n,a1,a2,a3;
freopen("t.in","r",stdin);
freopen("t.out","w",stdout);
read(T);
while (T--){
read(n);
read(a1); read(a2);
a1%=a2;
for (int i=3;i<=n;i++)
read(a3),a1=a1*a3%a2;
if (a1)
printf("No\n");
else
printf("Yes\n");
}
return 0;
}