Codeforces 922C - Cave Painting(思维 + 暴力)

 Cave Painting

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 到 k 有无 两个数或以上，n 对其取模 相等。

思路：

如果数n % i的结果都不同，则需要

n % 1 == 0

n % 2 == 1

n % 3 == 2

n % 4 == 3

......

n % i == i - 1

所以，，，，， 直接暴力判断就可以了。。。可以用  vis  数组  ，也可以判断  n % i  == i - 1 ? 

AC代码：

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

int main()
{
    ll n,k; scanf("%I64d%I64d",&n,&k);
    int flag = 1;
    for(ll i = 1;i <= k;i ++)
        if(n % i != i - 1){
            flag = 0;
            break;
        }
    if(flag) puts("Yes");
    else puts("No");
    return 0;
}