Codeforces Round #444 (Div. 2) A. Div. 64

A. Div. 64

Problem Statement

    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

Example 1
    Input
        100010001
    Output
        yes
Example 2
    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

题意

    给一个二进制串，问你能否在其中删去一些数字使它表示的十进制数可以被64整除（0不算）。
    P.S. 64的二进制表示为1000000。

思路

    首先我们知道，要是一个数可以被64整除，那么它的二进制位中最后六位一定都是0，因为64的二进制表示为1000000。而要是一个数的最后6位不是0，那么说明他一定加了一个比64还小的数，那么是不可能被64整除的，所以对于一个二进制串，我们只需要从左往右找到第一个1，再往后扫是否有6个或以上的0就行了，不连续也行。

Code

#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool Finish_read;
template<class T>inline void read(T &x){Finish_read=0;x=0;int f=1;char ch=getchar();while(!isdigit(ch)){if(ch=='-')f=-1;if(ch==EOF)return;ch=getchar();}while(isdigit(ch))x=x*10+ch-'0',ch=getchar();x*=f;Finish_read=1;}
template<class T>inline void print(T x){if(x/10!=0)print(x/10);putchar(x%10+'0');}
template<class T>inline void writeln(T x){if(x<0)putchar('-');x=abs(x);print(x);putchar('\n');}
template<class T>inline void write(T x){if(x<0)putchar('-');x=abs(x);print(x);}
/*================Header Template==============*/
string s;
int main() {
    cin>>s;
    if(s.length()<7) {
        puts("no");
        return 0;
    }
    int tot=-1;
    for(int i=0;i<s.length();i++) {
        if(s[i]=='1'&&tot==-1)
            tot=0;
        if(tot==-1)
            continue;
        if(s[i]=='0')
            tot++;
    }
    if(tot<6) {
        puts("no");
        return 0;
    }
    puts("yes");
    return 0;
}