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

 C++代码：

#include<iostream>
#include<algorithm>
#include<math.h>
#include<vector>
using namespace std;
bool cmp(int a,int b){
	return a>b;
}
int main(){
	int n;
	cin>>n;
	
	do{
		vector<int> vt;
		for(int i=0;i<4;i++){
			int m=0;
			m=n%10;
			vt.push_back(m);
			n/=10;
		}
		sort(vt.begin(),vt.end(),cmp);
		int a=0,b=0;
		for(int i=0;i<vt.size();i++){
			a=a*10+vt[i];  
			b=b*10+vt[vt.size()-i-1];
		}
		n=a-b; 
		printf("%04d - %04d = %04d\n",a,b,n);
	}while(n!=6174&&n!=0);
	return 0;
}

坑点：1.当输入的数n为6174和0时也需要输出，所以要用do...while语句

           2.求得个十百千位上的数用for循环而不用while（这是一直过不去的测试点）

           3.输出时要注意格式，4位输出，中间的空格也要注意