3191.txt

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

Source

Problem Id:3191  User Id:fzk 
Memory:60K  Time:0MS
Language:C++  Result:Accepted

Source 

#include <stdio.h>

int main( ) {
	int i, n, h;
	bool s[100];
	scanf( "%d", &n );

	if( n == 0 ) {
		printf( "0\n" );
		return 0;
	}

	i = 0;
	h = 1;
	while( n ) {
		if( n & 1 ) {
			s[i] = true;
			n -= h;
		}
		else
			s[i] = false;
		h = -h;
		n >>= 1;
		i++;
	}

	while( i-- )
		printf( "%d", s[i] );

	printf( "\n" );
	return 0;
}