codeforces687BRemainders Game+数论

Today Pari and Arya are playing a game called Remainders.

Pari chooses two positive integer x and k, and tells Arya k but not x. Arya have to find the value . There are n ancient numbers c1, c2, …, cn and Pari has to tell Arya if Arya wants. Given k and the ancient values, tell us if Arya has a winning strategy independent of value of x or not. Formally, is it true that Arya can understand the value for any positive integer x?

Note, that means the remainder of x after dividing it by y.
Input

The first line of the input contains two integers n and k (1 ≤ n,  k ≤ 1 000 000) — the number of ancient integers and value k that is chosen by Pari.

The second line contains n integers c1, c2, …, cn (1 ≤ ci ≤ 1 000 000).
Output

Print “Yes” (without quotes) if Arya has a winning strategy independent of value of x, or “No” (without quotes) otherwise.
Examples
Input

4 5
2 3 5 12

Output

Yes

Input

2 7
2 3

Output

No

Note

In the first sample, Arya can understand because 5 is one of the ancient numbers.

In the second sample, Arya can’t be sure what is. For example 1 and 7 have the same remainders after dividing by 2 and 3, but they differ in remainders after dividing by 7.

给出n个数和k问能不能唯一确定x,我可以询问n个数的取膜结果。
首先如果我们可以知道x的倍数膜k的值。那么我们也是可以知道x的值，如果只是知道k的一些因子的取膜的值。我们也是无法确定x的。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
using namespace std;

#define LL long long
long long gcd(long long x, long long y) {
    if (!x) return y;
    else return gcd(y % x, x);
}

long long lcm(long long x, long long y) {
    return x * y / gcd(x, y);
}
LL n,k,x;
int main() {
    scanf("%I64d %I64d",&n,&k);
    long long now=1;
    for (int i=1;i<=n;i++) {
        scanf("%I64d", &x);
        now=lcm(now,gcd(k,x));
    }
    if (now%k==0) printf("Yes\n");
    else printf("No\n");
    return 0;
}