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

int main()
{
	__int64 twobase[31], tenbase[10];
	int i, j,;
	__int64 n;
	char in[4];
	twobase[0] = 1;
	tenbase[0] = 1;

	for (i = 1; i < 31; i++)
	{
		twobase[i] = twobase[i-1] + twobase[i-1];	
	}
	
	for (i = 1; i < 10; i++)
	{
		tenbase[i] = 10 * tenbase[i-1];	
	}
	
	while(scanf("%s", in)!= -1 && strcmp(in, "00e0") != 0)
	{
		n = (in[0] - '0') * 10 + (in[1] - '0');
		n *= tenbase[in[3]-'0'];
		for (i = 0; i < 30; i++)
		{
			if (n < twobase[i+1])
			{
				break;	
			}	
		}
		n = (n - twobase[i]) * 2 + 1;
		printf("%I64d\n",n);	
	}
	return 0;
}

• Re:按公式来算为什么WA了？ (766) appetite 2006-02-04 23:50:01
• 没必要用数组存下2^X，直接递归是O(logn)的时间，0ms (705) blablabla 2006-10-19 22:53:02