[Codeforces688D]Remainders Game（扩展中国剩余定理）

题目描述

题解

代码

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
#define LL long long
#define N 1000005

int n;
LL m
,k;

LL gcd(LL a,LL b)
{
if (!b) return a;
else return gcd(b,a%b);
}
int main()
{
scanf("%d%I64d",&n,&k);
for (int i=1;i<=n;++i) scanf("%I64d",&m[i]);
m[1]%=k;
for (int i=2;i<=n;++i)
{
m[i]=m[i-1]*m[i]/gcd(m[i-1],m[i]);
m[i]%=k;
}
if (!m
) puts("Yes");
else puts("No");
}