CodeForces-687B Remainders Game（数学题）

Description
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.

Sample Input
Input
4 5
2 3 5 12
Output
Yes
Input
2 7
2 3
Output
No

题目大意：

两个人P和A在玩游戏，P选个两个数x和k，他把k告诉A，A想要知道x%k,但A可以向P询问n个数c1,c2…cn,P告诉他x%c1,x%c2…的值，问A可不可以通过这些值推出x%k？

题目分析：

一开始考虑的是用k除以gcd(k,c1),gcd(k,c2)…直到除为1为止。但仔细一想这样不对，比如k=8，c={2,4}这种存在重复因子的情况就不容易处理，然后想到求c1,c2…cn的最小公倍数，但c有100万个数，直接求最小公倍数肯定炸了，百度一下发现灵感就是最小公倍数对取模满足分配律，所以就可以一直取模。

ac代码：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b){ return b == 0 ? a : gcd(b, a%b);  }//最大公约数
ll lcm(ll a, ll b){ return a * b / gcd(a, b);  }//最小公倍数
int main() {
  int n,j,c;ll k,ans=1;
  scanf("%d %I64d",&n,&k);
  for(int i=0;i<n;i++) {
    scanf("%d",&c);
    ans=lcm(c,ans)%k;
  }

  if(ans)
    printf("No\n");
   else
    printf("Yes\n");
}