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.
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.
Print word 'YES' if the item can be weighted and 'NO' if it cannot.
3 7
YES
100 99
YES
100 50
NO
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(a)+W(b)+...+W(c)-W(d)-W(e)-....-W(f)其中W(a)为w的a次方且括号内的数不相同。
解题思路:将等式两边同时除以W若M%W!=0既考虑存在W(0)即考虑(M+1)%W和(M-1)%W若均不存在则无解否侧循环除以W当最终W为0时即有解否则无解
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<queue>
#include<list>
#include<cmath>
#include<vector>
using namespace std;
int main()
{
int n,w;
while(scanf("%d%d",&w,&n)!=EOF){
while(((n+1)%w==0)||((n-1)%w==0)||(n)%w==0){
if(n%w==0)n=n/w;
else if((n-1)%w==0)n=(n-1)/w;
else if((n+1)%w==0)n=(n+1)/w;
if(n==0)break;
}
if(n){
printf("NO\n");
}
else {
printf("YES\n");
}
}
return 0;
}