标签：uva

                               uva 575 Skew Binary

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 

Output 

Sample Input 

10120
200000000000000000000000000000
10
1000000000000000000000000000000
11
100
11111000001110000101101102000
0

Sample Output 

44
2147483646
3
2147483647
4
7
1041110737

题目大意：根据公式求值。

解题思路：模拟公式。

#include<stdio.h>
#include<string.h>
#include<math.h>
int main() {
	char str[100];
	while (true) {
		memset(str, 0, sizeof(str));
		scanf("%s", str);
		int len = strlen(str);
		if (len == 1 && str[0] == '0') break;
		int sum = 0;
		int two = 2;
		int temp;
		while (len) {
			temp = str[len - 1] - '0';
			sum += (two - 1) * temp;
			two *= 2;
			len--;
		}
		printf("%d\n", sum);
	}	
	return 0;
}

uva 575 Skew Binary（数论）

标签：uva

原文地址：http://blog.csdn.net/llx523113241/article/details/43154947