题目链接:点击进入
题意
给你 n , k , 问是否 n % i ( 1<= i <= k ) 的值都不一样
思路
若n % i 的结果都不同,则
n % 1 = 0
n % 2 = 1
n % 3 = 2
n % 4 = 3
…
n % i = i - 1
代码
#include<iostream>
#include<string>
#include<map>
#include<set>
//#include<unordered_map>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<fstream>
#define X first
#define Y second
#define INF 0x3f3f3f3f
#define pii pair<int, int>
//#define pdi pair<double,int>
//#define int long long
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
const int maxn=1e6+10;
const int mod=114514;
ll ans,a[maxn],b[maxn],d[maxn];
int main( )
{
ios::sync_with_stdio(false);
ll n,k;
cin>>n>>k;
for(ll i=1;i<=k;i++)
{
if(n%i!=i-1)
{
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
return 0;
}