B. 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 52 3 5 12
output
Yes
input
2 72 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.

Hint

Assume the answer of a test is No. There must exist a pair of integers x1 and x2 such that both of them have the same remainders after dividing by any ci, but they differ in remainders after dividing by k. Find more facts about x1 and x2!

Solution

Consider the x1 and x2 from the hint part. We have x1 - x2 ≡ 0 ( ) for each 1 ≤ i ≤ n.

So: We also have ( ). As a result: We've found a necessary condition. And I have to tell you it's also sufficient!

Assume , we are going to prove there exists x1, x2 such that x1 - x2 ≡ 0 ( ) (for each 1 ≤ i ≤ n), and ( ).

A possible solution is x1 = lcm(c1, c2, ..., cn) and x2 = 2 × lcm(c1, c2, ..., cn), so the sufficiency is also proved.

So you have to check if lcm(c1, c2, ..., cn) is divisible by k, which could be done using prime factorization of k and ci values.

For each integer x smaller than MAXC, find it's greatest prime divisor gpdx using sieve of Eratosthenes in .

Then using gpd array, you can write the value of each coin as p1q1p2q2...pmqm where pi is a prime integer and 1 ≤ qi holds. This could be done in by moving from ci to and adding gpdci to the answer. And you can factorize k by the same way. Now for every prime p that , see if there exists any coin i that the power of p in the factorization of ci is not smaller than the power of p in the factorization of k.

Complexity is .

x1-x2≡0(mod ci)----->lcm(c1,c2,..,cn)|x1-x2

x1-x2!≡0(mod k)

//
//  main.cpp
//  cf687b
//
//  Created by Candy on 9/20/16.
//

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
;
,f=;
; c=getchar();}
+c-'; c=getchar();}
return x*f;
}
int n,k,c[N];
bool check(int a){
;i<=n;i++) ) ;
;
}
int main(int argc, const char * argv[]) {
;i<=k;i++){
;
) a*=i,k/=i;
&&!check(a)){printf(;}
}
printf("Yes");
;
}

Codeforces 687B. Remainders Game[剩余]的更多相关文章

1. codeforces 687B - Remainders Game 数学相关（互质中国剩余定理）

题意:给你x%ci=bi(x未知),是否能确定x%k的值(k已知) ——数学相关知识: 首先:我们知道一些事情,对于k,假设有ci%k==0,那么一定能确定x%k的值,比如k=5和ci=20,知道x% ...

2. CodeForces 687B Remainders Game

数论. 如果$x$不唯一,假设存在两个解,较大的为${x_1}$,较小的为${x_2}$. 那么, \$\left\{ {\begin{array}{*{20}{c}}{{x_1}\% {c_i} = ...

3. CodeForces 687B Remainders Game(数学，最小公倍数)

题意:给定 n 个数,一个数 k,然后你知道一个数 x 取模这个 n 个的是几,最后问你取模 k,是几. 析:首先题意就看了好久,其实并不难,我们只要能从 n 个数的最小公倍数是 k的倍数即可,想想为 ...

4. Codeforces Round #360 (Div. 2) D. Remainders Game 中国剩余定理

题目链接: 题目 D. Remainders Game time limit per test 1 second memory limit per test 256 megabytes 问题描述 To ...

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

D. Remainders Game 题目连接: http://www.codeforces.com/contest/688/problem/D Description Today Pari and ...

6. Codeforces Educational Codeforces Round 5 E. Sum of Remainders 数学

E. Sum of Remainders 题目连接: http://www.codeforces.com/contest/616/problem/E Description The only line ...

7. Codeforces Round #360 (Div. 2) D. Remainders Game

D. Remainders Game time limit per test 1 second memory limit per test 256 megabytes input standard i ...

8. codeforces 360 D - Remainders Game

D - Remainders Game Description Today Pari and Arya are playing a game called Remainders. Pari choos ...

9. codeforces 616E Sum of Remainders (数论，找规律）

E. Sum of Remainders time limit per test 2 seconds memory limit per test 256 megabytes input standar ...

随机推荐

1. unity中的WWW通讯问题

网上很多写到WWW的问题. 一.局限性比较大,使用不方便二.WWW类的使用不符合微软的命名规范三.在大量并发使用WWW类会发生"Too Many Threads"的异常 确实有些, ...

2. Add SSH Key to GitLab on Windows

Download Git for windows Open Git Bash Type in "ssh-keygen -t rsa", and then press Enter b ...

3. [webkit移动开发笔记]之如何去除android上a标签产生的边框

去年年底,做完最后一个项目就可以开开心心回家,可是在测试阶段,发现了不少bug,为了不影响回家时间,加班加点也要解决这些问题,这里算是工作回忆,也算是工作的一点小总结. 在ios4+和android2 ...

4. java中判断字符串是否为数字的三种方法

以下内容引自  http://www.blogjava.net/Javaphua/archive/2007/06/05/122131.html 1用JAVA自带的函数   public static ...

5. JavaScript基础知识整理（1）数组

第一:创建. 1,var arr= new Array(); //数组为空.长度为0. arr="apple"; arr="orange"; arr ...

6. CF196 D2 D

Book of Evil,有一颗树,n个节点,有m个节点被标记,问n个节点中,有多少个节点,这些节点与这m个节点的最远的距离小于等于d. 用down[i], up[i]分别标记只考虑以i为root的子 ...

7. 浅析JAVA设计模式（三）

4.接口隔离原则: ISP(Interface Segregation Principle)  客户端不应该依赖它不需要的接口,或者说类的依赖的关系应该建立在最小的接口上.举个例子,直接上代码:  1 ...

8. Jquery 限制文本框输入字数【转】

<script type="text/javascript" src="js/jquery.min.js" ></script> < ...

9. MacOS + Linux + Nginx

Asp.Net Core 发布和部署( MacOS + Linux + Nginx ) 前言 在上篇文章中,主要介绍了 Dotnet Core Run 命令,这篇文章主要是讲解如何在Linux中,对 ...

10. Server 2008 R2远程桌面授权,解决120天过期问题

平时在使用远程桌面过程,我们经常会遇到这样的两个问题. 问题一.远程桌面的连接数限制 Server 2008 R2默认远程桌面连接数是2个用户,如果多余两个用户进行远程桌面连接时,系统就会提示超过连接 ...