CF 887A

最新推荐文章于 2022-01-01 11:13:28 发布

原创最新推荐文章于 2022-01-01 11:13:28 发布 · 993 阅读

0 ·

CC 4.0 BY-SA版权

codeforces 专栏收录该内容

2 篇文章

订阅专栏

Top-model Izabella participates in the competition. She wants to impress judges and show her mathematical skills.

Her problem is following: for given string, consisting of only 0 and 1, tell if it's possible to remove some digits in such a way, that remaining number is a representation of some positive integer, divisible by 64, in the binary numerical system.

Input

In the only line given a non-empty binary string s with length up to 100.

Output

Print «yes» (without quotes) if it's possible to remove digits required way and «no» otherwise.

        Examples
      
          input
        
100010001

          output
        
yes

          input
        
100

          output
        
no

Note

In the first test case, you can get string 1 000 000 after removing two ones which is a representation of number 64 in the binary numerical system.

You can read more about binary numeral system representation here: https://en.wikipedia.org/wiki/Binary_system

先来一道比较简单的水题。。题目的意思是给你一个01串，问你去掉一些字符使得剩下的01串组成的2进制表示的数字可以整除64。64的二进制串为1000000，那么我们可以得出，假如所给的串中有6个0，并且6个0之前有一个1，那么就符合题目的要求，问题得解。简单的模拟即可

AC代码：

#include <cstdio>
#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    string s;
    cin >> s;
    int len=s.length();
    int cnt0=0;
    int flag=0;
    for(int i=len-1;i>=0;i--)
    {
        if(s[i]=='0') cnt0++;
        if(cnt0>=6)
        {
            for(int j=i;j>=0;j--)
            {
                if(s[j]=='1')
                {
                    flag=1;
                    break;
                }
            }
        }
        if(flag) break;
    }
    if(flag) cout << "yes" << endl;
    else cout << "no" << endl;
    return 0;
}