UVA - 575 Skew Binary

最新推荐文章于 2022-01-24 20:19:49 发布

苏摩夜

最新推荐文章于 2022-01-24 20:19:49 发布

阅读量429

点赞数

分类专栏：数论文章标签： uva UVA - 575 Skew Binar

本文链接：https://blog.csdn.net/zz_FreeSky/article/details/38488613

版权

数论专栏收录该内容

8 篇文章 0 订阅

订阅专栏

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,

$\begin{displaymath}81307_{10} = 8 \times 10^4 + 1 \times 10^3 + 3 \times 10^2 + ......mes 10^1 +7 \times 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 2^k. For example,

$\begin{displaymath}10011_2 = 1 \times 2^4 + 0 \times 2^3 + 0 \times 2^2 + 1 \times 2^1 +1 \times 2^0 = 16 + 0 + 0 + 2 + 1 = 19.\end{displaymath}$

In skew binary, the k-th digit represents a multiple of 2^k⁺¹ - 1. The only possible digits are 0 and 1, except that the least-significant nonzero digit can be a 2. For example,

$\begin{displaymath}10120_{skew} = 1 \times (2^5 - 1) + 0 \times (2^4-1) + 1 \tim......2 \times (2^2-1) + 0 \times (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.)

10120
200000000000000000000000000000
10
1000000000000000000000000000000
11
100
11111000001110000101101102000
0

Sample Output

44
2147483646
3
2147483647
4
7
1041110737





#include<iostream>
#include<math.h>
#include<stdio.h>
#include<string.h>
#define N 100
using namespace std;

char a[N];

int main(){

	while(cin >> a)
	{
	
		int m = strlen(a);
		if(a[0] == '0')
			break;
	long long int sum = 0;
	
		for(int i = m ;i >= 1; i--)
		{
			sum += (a[m-i] - '0') * (pow (2,i) - 1);


		}

		printf("%lld\n",sum);


	}
	return 0;

}