沐枫NOI 25. Binary Number

最新推荐文章于 2020-08-31 00:15:23 发布

多一些不为什么的坚持

最新推荐文章于 2020-08-31 00:15:23 发布

阅读量361

点赞数 1

分类专栏：沐枫NOI

本文链接：https://blog.csdn.net/qq_33193309/article/details/78511851

版权

沐枫NOI 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

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 x and wants to get a number one from it. While x is not equal to 1, Fangy repeats the following action: if x is odd, then he adds 1 to it, otherwise he divides x by 2. 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 x?

Input

The first line contains a positive integer x in a binary system. It is guaranteed that the first digit of x is different from a zero and the number of its digits does not exceed 106.

Output

Print the required number of actions.

Examples

Input

Output

Input

Output

Input

Output

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<queue>
#include<cstring>
#include<map>
using namespace std;
int main(){
	string str;
	cin>>str;
	int len=str.size()-1;
	int sum=0;
	while(len){
		if(str[len]=='0'){
			sum++;
			len--;
		}else{
			sum+=2;
			for(len--;str[len]=='1';len--) sum++;
			if(len<0) break;
			if(len) str[len]='1';
			else sum++;
		}
	}
	cout<<sum;
	return 0;
}