n, m = map(int, input().split())
ar = []
while n:
ar.append(n % m)
n //= m
if len(ar) == len(set(ar)):
print('YES')
else:
print('NO')#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define nl cout << "\n"
#define sort(v) sort(v.begin(),v.end())
#define loop(x,y) for(ll i = x;i < y;i++)
#define ts ll t; cin >> t;while
#define speedUp ios_base::sync_with_stdio(0), cin.tie(0),cout.tie(0);
using namespace std;
ll pr(ll n)
{
for (ll i = 2; i * i <= n; i++)
if (n % i == 0) return i;
return n;
}
int main()
{
speedUp;
// freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
ll n, m; cin >> n >> m;
vector <ll> v;
set <ll> s;
while (n) {
v.push_back(n % m), s.emplace(n % m);
n /= m;
}
if (v.size() == s.size()) cout << "YES";
else cout << "NO";
return 0;
}
672. Richest Customer Wealth | 1470. Shuffle the Array |
1431. Kids With the Greatest Number of Candies | 1480. Running Sum of 1d Array |
682. Baseball Game | 496. Next Greater Element I |
232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |
415. Add Strings | 22. Generate Parentheses |
13. Roman to Integer | 2. Add Two Numbers |
515. Find Largest Value in Each Tree Row | 345. Reverse Vowels of a String |
628. Maximum Product of Three Numbers | 1526A - Mean Inequality |
1526B - I Hate 1111 | 1881. Maximum Value after Insertion |
237. Delete Node in a Linked List | 27. Remove Element |