POJ1565 ZOJ1712 UVA575 UVALive5320 Skew Binary【进制】

509 篇文章 9 订阅
281 篇文章 4 订阅

Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 11253 Accepted: 7165

Description

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

Source



Regionals 1997 >> North America - Mid-Central USA


问题链接POJ1565 ZOJ1712 UVA575 UVALive5320 Skew Binary

问题简述:(略)

问题分析

  简单的进制有关的问题,看懂题意应该就没有问题了

程序说明

  有关2进制的计算,移位运算符是好用的!

题记:(略)

参考链接:(略)


AC的C++语言程序如下:

/* POJ1565 ZOJ1712 UVA575 UVALive5320 Skew Binary */

#include <iostream>
#include <stdio.h>
#include <string.h>

using namespace std;

const int N = 32;
char s[N + 1];

int main()
{
    while (gets(s) && s[0] != '0') {
        int len = strlen(s), ans = 0;
        for (int i = 0 ;i < len; i++)
            ans += (s[i] - '0') * ((1 << (len - i)) - 1);
        printf("%d\n", ans);
    }

    return 0;
}






  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值