3092.txt

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

Source

Problem Id:3092  User Id:fzk 
Memory:40K  Time:0MS
Language:G++  Result:Accepted

Source 

#include <stdio.h>
int a[100];
int b[100];

int main( ) {

	int n, i, k, t, tt, p, count = 0;

	scanf( "%d", &tt );

	while( tt-- ) {
		scanf( "%d", &n );
		k = 0;
		p = 0;
		while( n ) {
			for( ; !(n&1); p++, n>>=1 )
				;
			for( t=1, i=0; t*3<=n; t*=3,i++ )
				;
			a[k] = p;
			b[k] = i;
			n -= t;
			k++;
		}
		printf( "%d %d", ++count, k );
		while( k-- )
			printf( " [%d,%d]", a[k], b[k] );
		printf( "\n" );
	}
	return 0;
}