1147.txt

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

/////////////////////////////////////////////////////////////
//Binary codes
//
//
//

#include <stdio.h>

char w[3010];
int next[3010];

int main()
{	
	int i, n, zero, j, k;
	
	scanf( "%d", &n );
	
	for( zero = 0,i = 0; i < n; i++ )
	{
		
		do
		{
			scanf( "%c", &w[i] );
		}while( w[i] != '0' && w[i] != '1' );
		

		if( w[i] == '0' ) zero++;
	}

	for( i = 0,j = 0,k = 0; i < n; i++ )
	{
		if( w[i] == '0' )
		{
			next[j++] = i;
		}
		else next[zero+(k++)] = i;
	}

	for( i = next[0],j = 0; j < n ; i = next[i], j++ )
	{
		if( j ) printf(" ");
		
		printf( "%c", w[i] );
	}
	printf( "\n" );
	
	return 0;
}