Codeforces Round #461 (Div. 2) C. Cave Painting(数论 思维)

C. Cave Painting

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Imp is watching a documentary about cave painting.

Some numbers, carved in chaotic order, immediately attracted his attention. Imp rapidly proposed a guess that they are the remainders of division of a number n by all integers i from 1 to k. Unfortunately, there are too many integers to analyze for Imp.

Imp wants you to check whether all these remainders are distinct. Formally, he wants to check, if all , 1 ≤ i ≤ k, are distinct, i. e. there is no such pair (i, j) that:

• 1 ≤ i < j ≤ k,
• , where  is the remainder of division x by y.

Input

The only line contains two integers n, k (1 ≤ n, k ≤ 1018).

Output

Print "Yes", if all the remainders are distinct, and "No" otherwise.

You can print each letter in arbitrary case (lower or upper).

Examples

input

4 4

output

No

input

5 3

output

Yes

Note

In the first sample remainders modulo 1 and 4 coincide.

题意：输入n，k，求所有1<=i<j<=k,是否满足n%i！=n%j，若满足 输出Yes，否则 输出No，也就是n%（1~k）所有的数取余，余数是不是都不一样；

这个道题的突破点是，所有数对1取余都等于0,假如 一个数n mod 1 = 0，n mod 2 只能等于0或1，因0被占了，只能是1，n mod 3 因0,1被占了只能是2，依次类推，只要判断 n%i == i-1 即可，因为n和k的范围，刚开始暴力，你心里一定没有底，在这里我们构造一个 1~k Yes的最小n，看n的范围，为什么这么构造呢，因为满足 (1<=i<=k) n%i == i-1 k的范围一定不是太大；构造一个1~k Yes的最小n，实际上是lcm(1<=i<=k) - 1;首先说一下为什么,lcm(1<=i<=k) 对 1~k中所有的数取余一定是 0，所以 ( lcm(i<=i<=k) - 1 )% i  = i - 1,也就是 i 的公倍数 - 1 对 i 取余，这一定等于 i-1 啊；不懂得自己举个例子，下面给出一幅图，左边是k，右边是Yes的最小n

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
	__int64 i,j,k,n;
	while(~scanf("%I64d%I64d",&n,&k))
	{
		int f = 0;	
		for(i = 1;i<=k;i++)
		{
			if(n%i!=i-1)
			{
				f = 1;
				break;
			}
		}
		if(f) printf("No\n");
		else printf("Yes\n");		
	}
	return 0;
}