C. Vanya and Scales
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Vanya has a scales for weighing loads and weights of masses w0, w1, w2, …, w100 grams where w is some integer not less than 2 (exactly one weight of each nominal value). Vanya wonders whether he can weight an item with mass m using the given weights, if the weights can be put on both pans of the scales. Formally speaking, your task is to determine whether it is possible to place an item of mass m and some weights on the left pan of the scales, and some weights on the right pan of the scales so that the pans of the scales were in balance.
Input
The first line contains two integers w, m (2 ≤ w ≤ 109, 1 ≤ m ≤ 109) — the number defining the masses of the weights and the mass of the item.
Output
Print word ‘YES’ if the item can be weighted and ‘NO’ if it cannot.
Examples
input
3 7
output
YES
input
100 99
output
YES
input
100 50
output
NO
Note
Note to the first sample test. One pan can have an item of mass 7 and a weight of mass 3, and the second pan can have two weights of masses 9 and 1, correspondingly. Then 7 + 3 = 9 + 1.
Note to the second sample test. One pan of the scales can have an item of mass 99 and the weight of mass 1, and the second pan can have the weight of mass 100.
Note to the third sample test. It is impossible to measure the weight of the item in the manner described in the input.
思路就是先把m分成w进制
然后如果是0和1就很正常
如果是w-1那么就可以放个更高的,右边放自己来平衡
w就直接放
但是更高位要+1
其他情况不行
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int bte[100000];
int main()
{
int n, m;
cin >> n >> m;
while (m)
{
bte[++bte[0]] = m%n;
m /= n;
}
bte[0] += 1;
for (int a = 1;a <= bte[0];a++)
{
if (bte[a] == 1 || bte[a] == 0)continue;
if (bte[a] >= n - 1)bte[a + 1]++;
else
{
cout << "NO";
return 0;
}
}
cout << "YES";
}