（甲） 1069 The Black Hole of Numbers

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 6174comes 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

key: 

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
int increase(int x)  //升序 
{
	int sum=0;
	int a[4]={0};
	for(int i=0;i<4;i++)
	{
		a[i]=x%10;
		x/=10;
	}
	sort(a,a+4);
	for(int i=0;i<4;i++)
	{
		sum=sum*10+a[i];
	}
	return sum;
}
int decrease(int x)  //降序
{
	int sum=0;
	int a[4]={0};
	for(int i=0;i<4;i++)
	{
		a[i]=x%10;
		x/=10;
	}
	sort(a,a+4);
	for(int i=3;i>=0;i--)
	{
		sum=sum*10+a[i];
	}
	return sum;
}
int main()
{
	int n;
	cin>>n;
	int f,m;
	f=decrease(n);
	m=increase(n);
	if(f==m) printf("%04d - %04d = %04d\n",n,n,0);
	else
	{
		int ans=f-m;
		if(ans==6174) printf("%04d - %04d = %04d\n",f,m,ans); //当第一次就得到6174时直接输出
		while(ans!=6174)
		{
			ans=f-m;
			printf("%04d - %04d = %04d\n",f,m,ans);
			f=decrease(ans);
			m=increase(ans);
			
		} 
		
	}
	return 0;
}