1906.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

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


unsigned __int64 n;
char f[66][100];


void print( int i )
{
	int l = strlen( f[i] );
	while( l-- ) printf( "%c", f[i][l] );
}

int main()
{
	int i, j, k, t;
	bool key;

	f[0][0] = '1';f[0][1] = '\0';
	for( i=1; i<66; i++ )
	{
		for( j=0; f[i-1][j]; j++ )
		{
			f[i][j] = ( f[i-1][j] - '0' ) * 3;
		}
		for( t=0,k=0; k<j; k++ )
		{
			f[i][k] += t;
			t = f[i][k] / 10;
			f[i][k] = f[i][k]%10 + '0';
		}
		if( t ) f[i][k] = t + '0', k++;
		f[i][k] = '\0';
	}


	while( 1 )
	{
		scanf( "%I64d", &n );
		
		if( n == 0 ) break;
		n--;
		
		printf( "{" );
		for( i=0,key=0; n > 0 ; i++,n/=2 )
		{
			if(  n & 1  )
			{
				
				if( key ) printf( "," );
				printf( " " );
				print( i );
				key = 1;
			}
			
		}
		printf( " }\n" );
	}

	return 0;
}