Codeforces Round #360 (Div. 2) D. Remainders Game（数学）

思路：满足lcm（c1,c2,c3,...,cn)%k==0就“yes"

#include<bits\stdc++.h>
using namespace std;
#define LL long long
LL gcd(LL a,LL b)
{
if(b==0)
return a;
return gcd(b,a%b);
}
LL lcm(LL a,LL b)
{
return a*b/gcd(a,b);
}

int main()
{
int n;
LL k;
scanf("%d%lld",&n,&k);
LL temp = 1;
for(int i = 1;i<=n;i++)
{
LL c;
scanf("%lld",&c);
temp = lcm(temp,c);
temp = gcd(temp,k);
if(temp==k)
{
printf("Yes\n");
return 0;
}
}
printf("No\n");
}


D. Remainders Game

time limit per test
1 second

memory limit per test
256 megabytes

input
standard input

output
standard output

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.