A8929 | Beautiful Decomposition
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Valera considers a number beautiful, if it equals $2^{k}$ or - $2^{k}$ for some integer $k$ $(k>=0)$ . Recently, the math teacher asked Valera to represent number $n$ as the sum of beautiful numbers. As Valera is really greedy, he wants to complete the task using as few beautiful numbers as possible.
Help Valera and find, how many numbers he is going to need. In other words, if you look at all decompositions of the number $n$ into beautiful summands, you need to find the size of the decomposition which has the fewest summands.
Help Valera and find, how many numbers he is going to need. In other words, if you look at all decompositions of the number $n$ into beautiful summands, you need to find the size of the decomposition which has the fewest summands.
输入格式
The first line contains string $s$ $(1<=|s|<=10^{6})$ , that is the binary representation of number $n$ without leading zeroes $(n>0)$ .
输出格式
Print a single integer — the minimum amount of beautiful numbers that give a total of $n$ .
输入输出样例
输入 #1
10
输出 #1
1
输入 #2
111
输出 #2
2
输入 #3
1101101
输出 #3
4
In the first sample $n=2$ is a beautiful number.
In the second sample $n=7$ and Valera can decompose it into sum $2^{3}+(-2^{0})$ .
In the third sample $n=109$ can be decomposed into the sum of four summands as follows: $2^{7}+(-2^{4})+(-2^{2})+2^{0}$ .
In the second sample $n=7$ and Valera can decompose it into sum $2^{3}+(-2^{0})$ .
In the third sample $n=109$ can be decomposed into the sum of four summands as follows: $2^{7}+(-2^{4})+(-2^{2})+2^{0}$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted