887A.md (1108B)
1 Source: https://codeforces.com/problemset/problem/887/A 2 3 A. Div. 64 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 Top-model Izabella participates in the competition. She wants to impress judges and show her mathematical skills. 22 23 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. 24 25 Input 26 27 In the only line given a non-empty binary string *s* with length up to 100. 28 29 Output 30 31 Print «yes» (without quotes) if it's possible to remove digits required way and «no» otherwise. 32 33 Examples 34 35 Input 36 37 ``` 38 100010001 39 ``` 40 41 Output 42 43 ``` 44 yes 45 ``` 46 47 Input 48 49 ``` 50 100 51 ``` 52 53 Output 54 55 ``` 56 no 57 ``` 58 59 Note 60 61 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. 62 63 You can read more about binary numeral system representation here: <https://en.wikipedia.org/wiki/Binary_system>