CodeForces 688D-Remainders Game

题意:
　　已知n, k与n个整数(c1,c2,...,cn),问你是否存在一个数x，使得它能被n个整数且k整除.

分析:
　　可以先将n个整数的最小公倍数lcm计算出来，再判断它是否能被k整除.

代码如下:

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <fstream>
 #include <ctime>
 #include <cmath>
 #include <cstdlib>
 #include <algorithm>
 #include <set>
 #include <map>
 #include <list>
 #include <stack>
 #include <queue>
 #include <iterator>
 #include <vector>

 using namespace std;

 #define LL long long
 #define INF 0x3f3f3f3f
 #define MOD 1000000007
 #define MAXN 10000010
 #define MAXM 1000010

 LL gcd(LL m, LL n)
 {
     LL a, b;
     a = m;
     b = n;
     if(a < b)
     {
         LL temp;
         temp = a;
         a = b;
         b = temp;
     }
     while(b != )
     {
         LL temp;
         temp = a%b;
         a = b;
         b = temp;
     }
     return a;
 }

 LL lcm(LL x, LL y)
 {
     return x/gcm(x, y)*y;
 }

 int main()
 {
     int n, k;
     LL ans, m;
     while(scanf("%d%d", &n, &k)==)
     {
         int i;
         ans = ;
         for(i = ; i <= n; i++ )
         {
             scanf("%lld", &m);
             ans = lcm(ans, m)%k;
         }
         if(ans == )
             printf("Yes\n");
         else
             printf("No\n");
     }

     return ;
 }