Codeforces 922C Cave Painting

题意: 给定$n,k$，判断是否存在二元组$(I,j)$，满足$1\leq i\leq j\leq k$ 且 $n\,\bmod\,i = n\,\bmod\,j$
思路：：找规律，很显然对于所有的$1\leq a \leq k$，如果存在$n\,\bmod\,a \neq i-1$,那么必定存在二元组满足题目条件

#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll MAXN = 1e5;

int main()
{
    ll n,k;
    while(cin>>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");
    }
}