本文共 1928 字，大约阅读时间需要 6 分钟。

When a number is expressed in decimal, the k-th digit represents a multiple of 10^k. (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 2^k. For example, 

In skew binary, the k-th 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, 

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³¹ - 1 = 2147483647.

Sample Input 

1012020000000000000000000000000000010100000000000000000000000000000011100111110000011100001011011020000

Sample Output 

44214748364632147483647471041110737

/*************************************************************************    > File Name: 12345.cpp    > Author: acmicpcstar    > Mail: acmicpcstar@gmail.com    > Created Time: 2014年04月24日 星期四 11时46分18秒 ************************************************************************/#include
    
     #include
     
      #include
      
       #include
       
        #include
        
         using namespace std;const double pi=atan(1.0)*4.0;int main(){string s;long long sum1,sum2,i;while(cin>>s){    if(s[0]=='0'&&s.length()==1) break;sum1=0;sum2=0;for(i=0;i
        
       
      
     
    

转载地址：https://www.cnblogs.com/acmicpcstar/p/3687185.html 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！