POJ 1565:Skew Binary
来源:互联网 发布:c语言sum是什么意思 编辑:程序博客网 时间:2024/05/18 02:56
Skew Binary
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10676 Accepted: 6807
Description
When a number is expressed in decimal, the kth digit represents a multiple of 10k. (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.)
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 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
1012020000000000000000000000000000010100000000000000000000000000000011100111110000011100001011011020000
Sample Output
44214748364632147483647471041110737
大水题。
代码:
#include <iostream>#include <vector>#include <string>#include <cstring>#include <algorithm>#include <cmath>using namespace std;string test;int main(){while(cin>>test){if(test=="0")break;int len = test.length();int i,k=1,result=0;for(i=len-1;i>=0;i--){result = result+ (int)(test[i]-'0')*(int)(pow((double)2,k)-1);k++;}cout<<result<<endl;}return 0;}
0 0
- poj 1565 Skew Binary
- POJ 1565 Skew Binary
- poj 1565 Skew Binary
- POJ 1565:Skew Binary
- POJ 1565 Skew Binary pow函数使用
- poj 1565 Skew Binary二进制转换
- POJ 1565 Skew Binary(简单题)
- pku 1565 Skew Binary
- Skew Binary-1565
- POJ 1565 Skew数
- poj 1362 Skew Binary 进制转换
- Skew Binary 1565 (简单数学)
- Skew Binary
- Skew Binary
- Skew Binary
- 575--Skew Binary
- uva 575Skew Binary
- uva 575 - Skew Binary
- GetObject 函数的使用
- 如何使用java synchronized进行线程同步
- ASP.NET 4.0的ID,ClientID,UniqueID及ClientIDMode属性篇
- Source Insight支持UTF-8插件安装说明
- LinearLayout中weight在小米上兼容的问题
- POJ 1565:Skew Binary
- windows服务器端口连接过多的一种解决方案
- OJ第三批——Problem B:分数类的四则运算【C++】
- [华为机试练习题]16.数字统计
- lucene3.6.1 经典案例 入门教程
- AtomicInteger 使用
- 文章标题
- iOS多线程的初步研究
- SegMentControl