zoj1712 Skew Binary
来源:互联网 发布:淘宝怎么没有朋友代付 编辑:程序博客网 时间:2024/06/04 17:56
When a number is expressed in decimal, the kth digit represents a multiple of 10 k. (Digits are numbered from right to left, where the least significant digit is number 0.) For example,
81307(10) = 8 * 10^4 + 1 * 10 ^3 + 3 * 10^2 + 0 * 10^1 + 7 * 10^0
= 80000 + 1000 + 300 + 0 + 7
= 81307.
When a number is expressed in binary, the kth digit represents a multiple of 2^k . For example,
10011(2) = 1 * 2^4 + 0 * 2^3 + 0 * 2^2 + 1 * 2^1 + 1 * 2^0
= 16 + 0 + 0 + 2 + 1
= 19.
In skew binary, the kth digit represents a multiple of 2^(k+1)-1. The only possible digits are 0 and 1, except that the least-significant nonzero digit can be a 2. For example,
10120(skew) = 1 * (2^5-1) + 0 * (2^4-1) + 1 * (2^3-1) + 2 * (2^2-1) + 0 * (2^1-1)
= 31 + 0 + 7 + 6 + 0
= 44.
The first 10 numbers in skew binary are 0, 1, 2, 10, 11, 12, 20, 100, 101, and 102. (Skew binary is useful in some applications because it is possible to add 1 with at most one carry. However, this has nothing to do with the current problem.)
Input
The input file contains one or more lines, each of which contains an integer n. If n = 0 it signals the end of the input, and otherwise n is a nonnegative integer in skew binary.
Output
For each number, output the decimal equivalent. The decimal value of n will be at most 2^31-1 = 2147483647.
Sample Input
10120
200000000000000000000000000000
10
1000000000000000000000000000000
11
100
11111000001110000101101102000
0
Sample Output
44
2147483646
3
2147483647
4
7
81307(10) = 8 * 10^4 + 1 * 10 ^3 + 3 * 10^2 + 0 * 10^1 + 7 * 10^0
= 80000 + 1000 + 300 + 0 + 7
= 81307.
When a number is expressed in binary, the kth digit represents a multiple of 2^k . For example,
10011(2) = 1 * 2^4 + 0 * 2^3 + 0 * 2^2 + 1 * 2^1 + 1 * 2^0
= 16 + 0 + 0 + 2 + 1
= 19.
In skew binary, the kth digit represents a multiple of 2^(k+1)-1. The only possible digits are 0 and 1, except that the least-significant nonzero digit can be a 2. For example,
10120(skew) = 1 * (2^5-1) + 0 * (2^4-1) + 1 * (2^3-1) + 2 * (2^2-1) + 0 * (2^1-1)
= 31 + 0 + 7 + 6 + 0
= 44.
The first 10 numbers in skew binary are 0, 1, 2, 10, 11, 12, 20, 100, 101, and 102. (Skew binary is useful in some applications because it is possible to add 1 with at most one carry. However, this has nothing to do with the current problem.)
Input
The input file contains one or more lines, each of which contains an integer n. If n = 0 it signals the end of the input, and otherwise n is a nonnegative integer in skew binary.
Output
For each number, output the decimal equivalent. The decimal value of n will be at most 2^31-1 = 2147483647.
Sample Input
10120
200000000000000000000000000000
10
1000000000000000000000000000000
11
100
11111000001110000101101102000
0
Sample Output
44
2147483646
3
2147483647
4
7
1041110737
将数字用gets()函数输入数组;
用比较函数strcmp(s,"0") != 0结束输入;
在语句sum=sum+(s[i]-'0')*(pow(2,l)-1);中(s[i]-'0'),因为ASCII码数字与输入数字大小不同!!!!
代码如下:
#include <iostream>#include <stdio.h>#include <string.h>#include <math.h>using namespace std;int main(){ int i; double l,sum; char s[31]; while(gets(s)&&strcmp(s,"0") != 0) { l=strlen(s); sum=0; for(i=0;i<strlen(s);i++,l--) sum=sum+(s[i]-'0')*(pow(2,l)-1); cout<<int(sum)<<endl; } return 0;}
- zoj1712 Skew Binary
- zoj1712
- ZOJ1712
- Skew Binary
- Skew Binary
- Skew Binary
- 575--Skew Binary
- pku 1565 Skew Binary
- uva 575Skew Binary
- uva 575 - Skew Binary
- Uva 575 - Skew Binary
- zoj 1712 Skew Binary
- 575 - Skew Binary
- 575 - Skew Binary
- uva 575 - Skew Binary
- ZOJ 1712 Skew Binary
- 575 - Skew Binary
- UVa 575 Skew Binary
- 【iOS-Cocos2d游戏开发】cocos2d 坐标系使用
- linux简单命令使用
- 怎么样延长后台网站管理登录进去的界面
- 一个简单的将GUI程序的log信息输出到关联的Console窗口中
- Spring核心(二)IoC介绍
- zoj1712 Skew Binary
- Android 4.0 截屏(Screenshot)代码流程小结
- 关于html中块级元素和级联元素的含义
- 如何在PL/SQL Developer中设置使其可以显示查询返回的所有记录
- webx—业务逻辑之结果集封装
- 异常的学习
- OpenGL
- 复习笔记9 if else 以及效率优化
- poj 1226 求多串最长公共子串 或 回文子串 KMP&&strstr&&后缀数组