zoukankan      html  css  js  c++  java
  • CodeForces 552C Vanya and Scales

    Vanya and Scales
    Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

    Description

    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 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 ≤ 1091 ≤ 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 Input

    Input
    3 7
    Output
    YES
    Input
    100 99
    Output
    YES
    Input
    100 50
    Output
    NO

    Hint

    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.

     1 #include <stdio.h>
     2 #include <string.h>
     3 int main()
     4 {
     5     int w,m;
     6     int i,j,flg;
     7     while(scanf("%d %d",&w,&m)!=EOF)
     8     {
     9         flg=1;
    10         while(m)
    11         {
    12             int a=m%w;
    13             if(a==1 || a==0)
    14             {
    15                 m=m/w;
    16             }
    17             else if(a==w-1)
    18             {
    19                 m=m/w+1;
    20             }
    21             else
    22             {
    23                 flg=0;
    24                 break;
    25             }
    26         }
    27         if(flg)
    28             printf("YES
    ");
    29         else
    30             printf("NO
    ");
    31     }
    32     return 0;
    33 }
    View Code
  • 相关阅读:
    周记
    周记
    代码复审核查表
    两人合作的案例and周记
    第一周周记
    15 手写数字识别-小数据集(2)
    11.分类与监督学习,朴素贝叶斯分类算法
    15 手写数字识别-小数据集
    14 深度学习-卷积
    十二次作业
  • 原文地址:https://www.cnblogs.com/cyd308/p/4771549.html
Copyright © 2011-2022 走看看