Submit | All submissions | Best solutions | Back to list |
SKEWB - 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 non-zero 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.)
Input
The input file contains one or more lines, each of which contains an integer
Output
For each number, output the decimal equivalent. The decimal value of n will be at most 231 - 1 = 2147483647.
Example
Input: 10120 200000000000000000000000000000 10 1000000000000000000000000000000 11 100 11111000001110000101101102000 0 Output: 44 2147483646 3 2147483647 4 7 1041110737
Added by: | Coach UTN FRSF |
Date: | 2011-03-11 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All |
Resource: | (UVa ACM) http://online-judge.uva.es/p/v5/575.html |
hide comments
2014-10-26 02:11:51 Kid Algorist
gets() led to 25% faster submission time. |
|
2011-03-29 21:18:10 Michael T
FFS _do not count_ on 0 end as in input sample: breaks at around 3rd test. |