C - Vanya and Scales CodeForces - 552C

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 99and 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.

刚开始做到这种类型的题

#include<bits/stdc++.h>
using namespace std;
int main(){
    int w, m;
    int s[120];
    cin >> w >> m;
    int len = 0;
    while(m){//进制转化
        s[len++] = m % w;
        m /= w;
    }
    int flag = 1;
    for(int i = 0; i <= len - 1; i++){//第i位是0另一个盘不用放砝码:
                                    //第i位是1另一个盘放w^i的砝码
                                    //第i位加1等于w的话进1
        if(s[i] == w){
            s[i + 1]++;
            s[i] -= w;
        }
        else if(s[i] <= 1)continue;
        else if(s[i] + 1 == w){
            s[i + 1]++;
            s[i] -= w;
        }
        else {
            flag = 0;
            break;
        }
    }
    if(flag)cout << "YES" <<endl;
    else cout << "NO" << endl;
    return 0;
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值