Skew Binary
When a number is expressed in decimal, the k-th digit represents a multiple of 10k. (Digits are numbered from right to left, where the least significant digit is number 0.) For example,
When a number is expressed in binary, the k-th digit represents a multiple of 2k. For example,
In skew binary, the k-th digit represents a multiple of 2k+1 - 1. The only possible digits are 0 and 1, except that the least-significant nonzero digit can be a 2. For example,
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.)
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
Skew Binary
Skew Binary |
When a number is expressed in decimal, the k-th digit represents a multiple of 10k. (Digits are numbered from right to left, where the least significant digit is number 0.) For example,
When a number is expressed in binary, the k-th digit represents a multiple of 2k. For example,
In skew binary, the k-th digit represents a multiple of 2k+1 - 1. The only possible digits are 0 and 1, except that the least-significant nonzero digit can be a 2. For example,
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.)
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 <iostream> #include <cstdio> #include <cstring> using namespace std; const int maxn = 100; long long power2(int a, int b) { long long result = 1, base = a; while(b != 0) { if(b&1) result *= base; base *= base; b >>= 1; } return result; } int main() { #ifdef LOCAL freopen("data.in", "r", stdin); freopen("ddta.out", "w", stdout); #endif // LOCAL long long bit[64]; for(int i = 0; i< 63; ++i) { bit[i] = power2(2, i+1) - 1; } char a[maxn]; long long sum; while(scanf("%s%*c", a) != EOF && a[0] != '0') { sum = 0; int j = 0; int len = strlen(a); for(int i = len-1; i >= 0; --i) { sum += (a[i] - '0')* bit[j]; j++; } cout << sum << endl; } return 0; }