CodeForces#round308C解题报告

题目描述：

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.

（——以上内容转自CodeForces）

        就是给一个W和一个M，问是否能使w^0,w^1,w^2,...,w^100中的某些数的和A，另一些数的和B，满足 A=B+M。（每个数只能使用一次或不使用）

        想了很久没有想出方法，暴力做果断MLE。后来列出数学式子就一下看出来了！看来列好公式很重要！

        实际上:   a0*w^0+a1*w^1+a2*w^2+...+ax*w^x = M    (ai = -1,0,1)  就是输出YES的条件。

        提取一下因式：a0 + w(a1+w(a2+w(...) ) ) = M ,可以看出来 M-a0一定是W的倍数，依次类推... 时间复杂度O(log(M)/log(W)).

#include<bits/stdc++.h>

using namespace std;

int W,M;

bool solve()
{
    while(M > 1)
    {
        if( (M-1)%W==0 ) M = (M-1)/W;
        else if( M%W==0 ) M = M/W;
        else if( (M+1)%W==0 ) M = (M+1)/W;
        else return false;
    }
    return true;
}

int main()
{
    cin >> W >> M;
    printf("%s\n",solve()?"YES":"NO");
    return 0;
}