Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- typedef long long ll;
- #define S(a) scanf("%d",&a)
- #define LS(a) scanf("%lld",&a)
- int main() {
- ll n, k;
- LS(n), LS(k);
- if (k >= 60) {
- printf("No\n");
- } else {
- // brute force as k < 60
- bool ans = 1;
- set<ll> st;
- for (ll i = 1; i <= k; ++i) {
- if (st.find(n % i) != st.end()) {
- ans = 0;
- break;
- }
- st.insert(n % i);
- }
- if (ans) {
- printf("Yes\n");
- } else {
- printf("No\n");
- }
- }
- return 0;
- }
- //
- // Created by sourav on 7/2/18.
- //
Add Comment
Please, Sign In to add comment