1069 The Black Hole of Numbers (20 分)

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<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
	int n;
	int a[4];
	scanf("%d",&n);
	while(1){
		int temp1,temp2;
		a[0]=n%10,a[1]=n%100/10;a[2]=n/100%10;a[3]=n/1000;
		sort(a,a+4);
		temp1=a[0]*1000+a[1]*100+a[2]*10+a[3];
		sort(a,a+4,greater<int>());
		temp2=a[0]*1000+a[1]*100+a[2]*10+a[3];
		n=temp2-temp1;
		printf("%04d - %04d = %04d\n",temp2,temp1,n);
		if(n==0||n==6174) break;
	}
	return 0; 
}
//2019.10.10 
//先整数换数组 然后排序 换整数 相减
//有个坑 一定要差为6174 输入为6174也要算