题意:
给出c1,c2,...cn,问对于任何一个正整数x,给出x%c1,x%c2,...的值x%k的值是否确定;
思路:
中国剩余定理。详见大神博客:ACdreamer
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>
#include <map>
using namespace std;
long long gcd(long long a,long long b){
if(b) return gcd(b,a%b);
return a;
}
int main()
{
long long n,m;
while(cin>>n>>m){
long long x,ans=1;
while(n--){
scanf("%I64d",&x);
ans=ans/gcd(ans,x)*x%m;
}
//cout<<ans<<endl;
if(ans%m)
cout<<"No"<<endl;
else
cout<<"Yes"<<endl;
}
}
Description