1019 数字黑洞,C

#include <stdio.h>

int daxiao(char * a)
{
	int i,j,k;
	for(i=0; i<3; i++)
		for(j=i; j<4; j++)
			if(a[i] < a[j])		
			{
				k = a[j];
				a[j] = a[i];
				a[i] = k;
			}
	return 0;
}
int xiaoda(char * a)
{
	int i,j,k;
	for(i=0; i<3; i++)
		for(j=i; j<4; j++)
			if(a[i] > a[j])		
			{
				k = a[j];
				a[j] = a[i];
				a[i] = k;
			}
	return 0;
}

int main()
{
	char a[5]={0};
	int c,d;

	scanf("%s",a);
	
	if( a[0]==a[1] && a[1]==a[2] && a[2]==a[3] )
		printf("%s - %s = 0000",a,a);
	else
	{
		while(!(a[0]==6+'0' && a[1]==1+'0' && a[2]==7+'0' && a[3]==4+'0'))
		{
		daxiao(a);
		c = (a[0]-'0')*1000 + (a[1]-'0')*100 + (a[2]-'0')*10 +(a[3]-'0');
		xiaoda(a);
		d = (a[0]-'0')*1000 + (a[1]-'0')*100 + (a[2]-'0')*10 +(a[3]-'0');
		printf("%04d - %04d = %04d",c,d,c-d);
		a[0]=(c-d)/1000+'0';a[1]=(c-d)/100%10+'0';a[2]=(c-d)/10%10+'0';a[3]=(c-d)%10+'0';
		
		if(!(a[0]==6+'0' && a[1]==1+'0' && a[2]==7+'0' && a[3]==4+'0'))
			printf("\n");
		}
	}
	
	return 0;
}