poj 1565 Skew Binary
2015-05-21 20:13
549 查看
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.)
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
Sample Output
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
char a[2000];
int main(){
long i,j,t,m,sum = 0;
while(scanf("%s",a) != EOF){
if(a[0] == '0')
break;
j = strlen(a);
for(i = 0;j >= 0;j--,i++){
m = a[j] - 48;
t = m*(pow(2,i)-1);
sum += t;
}
printf("%d\n",sum);
}
return 0;
}
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.)
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
10120 200000000000000000000000000000 10 1000000000000000000000000000000 11 100 11111000001110000101101102000 0
Sample Output
44 2147483646 3 2147483647 4 7 1041110737
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
char a[2000];
int main(){
long i,j,t,m,sum = 0;
while(scanf("%s",a) != EOF){
if(a[0] == '0')
break;
j = strlen(a);
for(i = 0;j >= 0;j--,i++){
m = a[j] - 48;
t = m*(pow(2,i)-1);
sum += t;
}
printf("%d\n",sum);
}
return 0;
}
相关文章推荐
- poj 1565 Skew Binary
- poj 1565 Skew Binary二进制转换
- POJ 1565:Skew Binary
- poj1565---(数论)skew binary
- POJ 1565:Skew Binary
- POJ 1565 Skew Binary(简单题)
- POJ 1565 Skew Binary(简单的问题)
- POJ 1565 Skew数
- OpenJudge / Poj 1565 Skew Binary C++
- poj 1362 Skew Binary 进制转换
- POJ 1565 Skew Binary pow函数使用
- POJ 1565 Skew Binary pow函数使用
- uva 575 - Skew Binary
- poj 1785 Binary Search Heap Construction( 分治 + RMQ )
- 插头DP——从不会到入门(POJ 2411,HDU 1565,HDU 2167,HDU 1693,Ural 1519)
- UVA - 575 Skew Binary
- poj 2116 Death to Binary? 模拟
- poj 2462 Period of an Infinite Binary Expansion
- uva 575 - Skew Binary
- POJ 3358 Period of an Infinite Binary Expansion ★ (数论好题:欧拉函数)