CF92B.Binary Number

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Little walrus Fangy loves math very much. That's why when he is bored he plays with a number performing some operations.

Fangy takes some positive integer xx and wants to get a number one from it. While xx is not equal to 11 , Fangy repeats the following action: if xx is odd, then he adds 11 to it, otherwise he divides xx by 22 . Fangy knows that for any positive integer number the process ends in finite time.

How many actions should Fangy perform to get a number one from number xx ?

输入格式

The first line contains a positive integer xx in a binary system. It is guaranteed that the first digit of xx is different from a zero and the number of its digits does not exceed 10610^{6} .

输出格式

Print the required number of actions.

输入输出样例

  • 输入#1

    1
    

    输出#1

    0
    
  • 输入#2

    1001001
    

    输出#2

    12
    
  • 输入#3

    101110
    

    输出#3

    8
    

说明/提示

Let's consider the third sample. Number 101110101110 is even, which means that we should divide it by 22 . After the dividing Fangy gets an odd number 1011110111 and adds one to it. Number 1100011000 can be divided by 22 three times in a row and get number 1111 . All that's left is to increase the number by one (we get 100100 ), and then divide it by 22 two times in a row. As a result, we get 11 .

首页