Codeforces Beta Round #75 (Div. 2) / 92B Binary Number(贪心)
来源:互联网 发布:俄罗斯网购软件 编辑:程序博客网 时间:2024/06/06 21:03
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?
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.
Print the required number of actions.
1
0
1001001
12
101110
8
Let's consider the third sample. Number 101110 is even, which means that we should divide it by 2. After the dividing Fangy gets an odd number 10111 and adds one to it. Number 11000 can be divided by 2 three times in a row and get number 11. All that's left is to increase the number by one (we get 100), and then divide it by 2 two times in a row. As a result, we get 1.
简单贪心,怎么处理n详见代码。
完整代码:
/*30ms,1000KB*/#include<cstdio>#include<cstring>char num[1000001];int main(){scanf("%s", num);int len = strlen(num) - 1, count = 0;while (len){if (num[len] == '0'){++count;for (; num[--len] == '0'; ++count);}else{count += 2;for (; --len && num[len] == '1'; ++count);if (len)num[len] = '1';else///连续读1读到最开头的情况,+1++count;}}printf("%d", count);return 0;}
- Codeforces Beta Round #75 (Div. 2) / 92B Binary Number(贪心)
- Codeforces Beta Round #92 (Div. 2 Only) B. Permutations
- Codeforces Round #202 (Div. 2)B-贪心
- Codeforces Round #428 (Div. 2) B 贪心
- Codeforces Beta Round #89 (Div. 2) C. Fancy Number
- Codeforces Beta Round #75 (Div. 1 Only)---B.Queue
- Codeforces Beta Round #95 (Div. 2) A B C E
- Codeforces Beta Round #86 (Div. 2 Only) B PFAST Inc.
- Codeforces Beta Round #96 (Div. 2)——B
- Codeforces Beta Round #93 (Div. 2 Only)——B
- Codeforces Beta Round #91 (Div. 2 Only)——B
- Codeforces Beta Round #89 (Div. 2)——B
- Codeforces Beta Round #18 (Div. 2 Only)——B
- Codeforces Beta Round #44 (Div. 2)——B
- Codeforces Beta Round #46 (Div. 2)——B
- Codeforces Beta Round #52 (Div. 2)——B
- Codeforces Beta Round #54 (Div. 2)——B
- Codeforces Beta Round #34 (Div. 2) B 题解
- NYOJ-477-A+B Problem III-2013年6月8日00:19:05
- 微信 天天爱消除 Lua无敌脚本
- 各种服务器+Servlet+过滤器+监听器+项目工作原理
- NYOJ-64-鸡兔同笼-2013年6月9日20:51:47
- android monitor tool (1.0 功能介绍)
- Codeforces Beta Round #75 (Div. 2) / 92B Binary Number(贪心)
- 解开初学者学android一头雾水,不理解android控件问题
- Apache suEXEC Privilege Elevation / Information Disclosure
- NYOJ-56-阶乘因式分解(一)-2013年6月10日12:20:54
- Android之JNI在fedora下的环境
- 配置Linux 11G R2 RAC NTP服务
- 分享8年开发经验,浅谈个人发展经历,明确自己发展方向
- Android开发中定时器的3种方法
- Spring AOP 详解