题目链接:http://codeforces.com/problemset/problem/687/B
solution:
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b){
if (!b)return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b){
return a * b / gcd (a, b);
}
int main()
{
long long n, k, temp = 1;
cin >> n >> k;
vector<long long> arr(n);
for (int i = 0; i < n; ++i){
scanf("%lld", &arr[i]);
temp = gcd(lcm(temp, arr[i]), k);
if (temp == k){
printf("Yes\n");
return 0;
}
}
printf("No\n");
return 0;
}