hdu 1714 排列2

//注意格式
#include<iostream>
#include<algorithm>
using namespace std;

int main()
{
	int a[5], ch[30];
	int i, j;
	bool p = false;
	while(scanf("%d%d%d%d", &a[0], &a[1], &a[2], &a[3]) && (a[0]||a[1]||a[2]||a[3]))
	{
		if(p)
			printf("\n");
		p = true;
		int t=0;
		memset(ch, 0, sizeof(ch));
		sort(a, a+4);
		do
		{
			ch[t++] = a[0]*1000 + a[1]*100 + a[2]*10 + a[3];
		}while(next_permutation(a, a+4));
		for(  i=0; i < t; i++ )
		{
			if(ch[i] < 1000)
				continue;
			printf("%d", ch[i]);
			if(ch[i]/1000 != ch[i+1]/1000 )
				printf("\n");
			else
				printf(" ");
		}
	}
	return 0;
}