CF 552-C. Vanya and Scales

原创 2015年07月06日 21:42:17
C. Vanya and Scales
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Vanya has a scales for weighing loads and weights of masses w0, w1, w2, ..., w100 grams where w is some integer not less than2 (exactly one weight of each nominal value). Vanya wonders whether he can weight an item with massm 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 massm 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.

Sample test(s)
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 masses9 and 1, correspondingly. Then7 + 3 = 9 + 1.

Note to the second sample test. One pan of the scales can have an item of mass99 and the weight of mass 1, and the second pan can have the weight of mass100.

Note to the third sample test. It is impossible to measure the weight of the item in the manner described in the input.



一个天平,100个weights,重量为w的0次幂到100次幂 各一个, 通过天平和一些weights,问测出重量为m的物体是否可行。


方法: 将m转化成w进制的数。 由于每种砝码只有1个。所以各个位如果 是0,代表该砝码没用到, 1代表砝码与物体异侧,w-1代表砝码与物体同侧。其他情况则不能构成m


#include<bits/stdc++.h>
#define For(i,a,b) for(int (i)=(a);(i) < (b);(i)++)
#define rof(i,a,b) for(int (i)=(a);(i) > (b);(i)--)
#define IOS ios::sync_with_stdio(false)
#define lson l,m,rt <<1
#define rson m+1,r,rt<<1|1
#define mem(a,b) memset(a,b,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
using namespace std;

const int maxn = 2e2+10;
const int INF =0x3f3f3f3f;
ll w,m;
int main()
{
    cin>>w>>m;
    ll bit[maxn];
    mem(bit,0);
    int len=0;
    while(m){
        bit[len++]=m%w;
        m/=w;
    }
    For(i,0,len){
        if(bit[i]==0||bit[i]==1) continue;
        if(bit[i]>=w-1) {
            bit[i+1]++;len++;
            continue;
        }
        else{
            cout<<"NO"<<endl;
            return 0;
        }
    }
    cout<<"YES"<<endl;
    return 0;
}



版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

cf552C. Vanya and Scales

C. Vanya and Scales time limit per test 1 second memory limit per test 256 megabytes ...

CodeForces 552C-Vanya and Scales【思维】

C. Vanya and Scales time limit per test 1 second memory limit per test 256 megabytes input sta...

我是如何成为一名python大咖的?

人生苦短,都说必须python,那么我分享下我是如何从小白成为Python资深开发者的吧。2014年我大学刚毕业..

codeforces 552C Vanya and Scales 【思维】

题目链接:http://codeforces.com/contest/552/problem/C ————————————–. C. Vanya and Scales time limit pe...

【30.23%】【codeforces 552C】Vanya and Scales

time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard...

Codeforces 552C. Vanya and Scales【巧】

C. Vanya and Scales time limit per test 1 second memory limit per test 256 megabytes ...

Codeforces 552.C Vanya and Scales

7.10.D 思维 进制转换

CF #308 Div.2 C题 Vanya and Scales 解题报告

原题: Vanya has a scales for weighing loads and weights of masses w0, w1, w2, ..., w100 grams where w...

CodeForces 552C Vanya and Scales(进制转化)

题意:转化成w进制表示就行了,如果有某一位是1表示放在异侧,是w-1就放在同侧。代码:// // Created by CQU_CST_WuErli // Copyright (c) 2015 ...

Codeforces Round #308 (Div. 2) C. Vanya and Scales dfs

题目链接:http://codeforces.com/contest/552/problem/C题意:给你100个砝码,第i个砝码质量是w^i,然后问你能不能在有m的情况下,左边和右边都放砝码,使得这...

Codeforces Round #308 (Div. 2) C. Vanya and Scales(数制转换)

http://codeforces.com/contest/552/problem/C 要用质量为w0,w1,…,w100的砝码各1个称出重量m,砝码可以放在天平左边也可以放在右边。问是否可以称出,...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)