PAT A1069

1069 The Black Hole of Numbers (20 分)
For any 4-digit integer except the ones with all the digits being the same, if we sort the digits in non-increasing order first, and then in non-decreasing order, a new number can be obtained by taking the second number from the first one. Repeat in this manner we will soon end up at the number 6174 – the black hole of 4-digit numbers. This number is named Kaprekar Constant.

For example, start from 6767, we’ll get:

7766 - 6677 = 1089
9810 - 0189 = 9621
9621 - 1269 = 8352
8532 - 2358 = 6174
7641 - 1467 = 6174
… …
Given any 4-digit number, you are supposed to illustrate the way it gets into the black hole.

Input Specification:
Each input file contains one test case which gives a positive integer N in the range (0,10
4
).

Output Specification:
If all the 4 digits of N are the same, print in one line the equation N - N = 0000. Else print each step of calculation in a line until 6174 comes out as the difference. All the numbers must be printed as 4-digit numbers.

Sample Input 1:
6767
Sample Output 1:
7766 - 6677 = 1089
9810 - 0189 = 9621
9621 - 1269 = 8352
8532 - 2358 = 6174
Sample Input 2:
2222
Sample Output 2:
2222 - 2222 = 0000

#include<cstdio>
#include<algorithm>
using namespace std;
int in[4];
bool cmp(int a,int b){
	return a>b;
}
int tonumber(int in[]){
	return 1000*(in[0])+100*(in[1])+10*(in[2])+1*(in[3]);
}
void toarray(int n){
	for(int i=0;i<4;i++)
	{
		in[3-i]=n%10;
		n/=10;
	}
}
int main()
{
	int x;
	scanf("%d",&x);
	toarray(x);
	while(1){
	sort(in,in+4);
	int a,b,c;
	b=tonumber(in);
	sort(in,in+4,cmp);
	a=tonumber(in);
	c=a-b;
	toarray(c);
	/*toarray(a);
	printf("%d%d%d%d - ",in[0],in[1],in[2],in[3]);
	toarray(b);
	printf("%d%d%d%d = ",in[0],in[1],in[2],in[3]);
	toarray(c);
	printf("%d%d%d%d\n",in[0],in[1],in[2],in[3]);*/
	printf("%04d - %04d = %04d\n",a,b,c);
	if(c==0||c==6174)
	break;
	}
	
	return 0;
}