1669.cpp

来自「这是哈尔滨工业大学acmOJ的源代码」· C++ 代码 · 共 33 行

/*  This Code is Submitted by wywcgs for Problem 1669 on 2005-10-29 at 04:07:09 */ 
#include <cstdio>

const int MAX = 48;

int main()
{
	long long f[MAX] = {1};
	int i, z, n, p;
	
	for(i = 1; i < MAX; i++) {
		f[i] = (long long)1 << i;
	}
	while(scanf("%de%d", &n, &z) == 2) {
		for(i = 0; i < z; i++) {
			n *= 10;
		}
		if(n == 0) {
			return 0;
		} else {
			for(p = 0; p < MAX; p++) {
				if(n < f[p]) {
					break;
				}
			}
			printf("%lld\n", 2*(n-f[p-1])+1);
		}
	}
	
	
	return 0;
}