Remainders Game CodeForces - 687B（数论）

最新推荐文章于 2024-02-21 20:09:02 发布

池南生苍龙

最新推荐文章于 2024-02-21 20:09:02 发布

阅读量303

点赞数

分类专栏：数论文章标签：数论

本文链接：https://blog.csdn.net/weixin_43896680/article/details/95652553

版权

这是一篇关于数论的游戏问题，Pari选择正整数x和k，Arya需要根据k和n个古代数字的余数推断出x除以k的余数。如果Arya对于任何x都有获胜策略，则输出'Yes'，否则输出'No'。解答关键在于检查n个数的最小公倍数是否为k的倍数。

摘要由CSDN通过智能技术生成

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