UVa575 Skew Binary

最新推荐文章于 2017-08-11 09:25:19 发布

江枭

最新推荐文章于 2017-08-11 09:25:19 发布

阅读量484

点赞数

分类专栏： UVa 文章标签： uva 算法

本文链接：https://blog.csdn.net/jiangxiao_lhm/article/details/9447077

版权

UVa 专栏收录该内容

57 篇文章 0 订阅

订阅专栏

Skew Binary

When a number is expressed in decimal, the k-th digit represents a multipleof 10^k. (Digits arenumbered 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 of2^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 - 1.The only possible digits are 0 and1, 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 isuseful in some applications because it is possible to add 1 with at mostone carry. However, thishas nothing to do with the current problem.)

10120
200000000000000000000000000000
10
1000000000000000000000000000000
11
100
11111000001110000101101102000
0

Sample Output

Miguel A. Revilla
1998-03-10

这道题目的大意就是给予一个数，然后将其转换为斜二进制表示，直接套用题中的公式即可。

#include <iostream>
#include <cstring>
#include <cmath>
using namespace std;

const int N = 40;
int num[N];
char str[N];
int ans;

int main() {
	while (cin >> str) {
		if (strcmp(str,"0") == 0)
			break;
		ans = 0;
		int len = strlen(str);
		for (int i = 0; i < len; i++)
			num[i] = str[len-i-1] - '0';
		for (int i = 0; i < len; i++) {
			ans += num[i] * (pow (2,i+1) - 1);
		}
		cout << ans << endl;
		memset(num,0,sizeof(num));
		memset(str,0,sizeof(str));
	}
	return 0;
}