zoukankan      html  css  js  c++  java
  • UVa 575 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, 

    egin{displaymath}81307_{10} = 8 	imes 10^4 + 1 	imes 10^3 + 3 	imes 10^2 + ...
...mes 10^1 +
7 	imes 10 0 = 80000 + 1000 + 300 + 0 + 7
= 81307.
end{displaymath}

    When a number is expressed in binary, the k-th digit represents a multiple of 2k. For example, 

    egin{displaymath}10011_2 = 1 	imes 2^4 + 0 	imes 2^3 + 0 	imes 2^2 + 1 	imes 2^1 +
1 	imes 2^0 = 16 + 0 + 0 + 2 + 1 = 19.
end{displaymath}

    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, 

    egin{displaymath}10120_{skew} = 1 	imes (2^5 - 1) + 0 	imes (2^4-1) + 1 	im...
...2 	imes (2^2-1) + 0 	imes (2^1-1)
= 31 + 0 + 7 + 6 + 0 = 44.
end{displaymath}

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

    Sample Input 

    10120
    200000000000000000000000000000
    10
    1000000000000000000000000000000
    11
    100
    11111000001110000101101102000
    0
    

    Sample Output 

    44
    2147483646
    3
    2147483647
    4
    7
    1041110737
    

    Miguel A. Revilla 
    1998-03-10

    题目的意思就是给一个特殊进制的数(第i位的权值为2^i-1),将它转化为十进制数

     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 
     5 using namespace std;
     6 
     7 char skew[50];
     8 int mul[32];
     9 
    10 int f()
    11 {
    12     int ans=0;
    13     int len=strlen(skew);
    14 
    15     for(int i=1;i<=len;i++)
    16         ans+=mul[i]*(skew[len-i]-'0');
    17 
    18     return ans;
    19 }
    20 
    21 int main()
    22 {
    23     for(int i=1;i<32;i++)
    24         mul[i]=(1<<i)-1;
    25 
    26     while(gets(skew))
    27     {
    28         if(strlen(skew)==1&&skew[0]=='0')
    29             break;
    30 
    31         printf("%d
    ",f());
    32     }
    33 
    34     return 0;
    35 }
    [C++]
  • 相关阅读:
    数组排序 -- 冒泡排序
    数组自带的函数(方法)
    京东官网轮播图的实现
    鼠标单击元素输出对应元素的索引号
    JavaScript中获取HTML元素的方式
    JavaScript数组的2种定义方式
    this关键字
    JavaScript中对象的3种定义方式
    Hadoop完整搭建过程(三):完全分布模式(虚拟机)
    Hadoop完整搭建过程(二):伪分布模式
  • 原文地址:https://www.cnblogs.com/lzj-0218/p/3531700.html
Copyright © 2011-2022 走看看