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 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<algorithm>
using namespace std;
//这个题用字符串处理比sscanf,sprintf直观,方便理解。要熟记字符串的各种功能函数呀！
bool cmp(char a,char b) {
	return a>b;
}
int main(){
	string s;
	cin>>s;
	s.insert(0,4-s.size(),'0');//注意insert及其用法 
	do{
		string a=s,b=s;
		sort(a.begin(),a.end(),cmp);//默认排序从小到大，从大到小要自定义 
		sort(b.begin(),b.end());
		int result=stoi(a)-stoi(b);//stoi,atoi都能把字符串转换为int型，用stoi就行了
		s=to_string(result);//to_string把int转换成字符串
		s.insert(0,4-s.size(),'0');
		cout<<a<<" - "<<b<<" = "<<s<<endl;
	}while(s!="6174"&&s!="0000");//用do...while而不用while，可以顺便包含了s=0000的情况 
	return 0;
}