1069 The Black Hole of Numbers -PAT甲级

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<bits/stdc++.h>
using namespace std;
map<char,int>mp;
int main(){
	string s;
	cin>>s;
	while(s.size()<4){
		s+='0';
	}
	do{
		mp.clear();
		for(int i=0;i<s.size();i++){
			mp[s[i]]++;
		}
		string s1="",s2;
		for(auto i:mp){
			int k=i.second;
			while(k--){
				s1+=i.first;
			}
		}
		s2=s1;
		reverse(s2.begin(),s2.end());//最大数
		int maxm,minm,val;
		stringstream ss;
		ss<<s2;
		ss>>maxm;
		stringstream tt;
		tt<<s1;
		tt>>minm;
		val=maxm-minm;
		printf("%04d - %04d = %04d\n",maxm,minm,val);
		if(val==0)
			break;
		stringstream aa;
		aa<<val;
		aa>>s;
		while(s.size()<4){
			s+='0';
		}
	}while(s!="6174");
	 
	return 0;
}

 看了大佬的代码，写的好溜

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,n1,n2;
	scanf("%d",&n);
	string num;
	do{
		num=to_string(n);
		while(num.size()<4){
			num+='0';
		}
		sort(num.begin(),num.end());
		n2=stoi(num);
		reverse(num.begin(),num.end());
		n1=stoi(num);
		n=n1-n2;
		printf("%04d - %04d = %04d\n",n1,n2,n);		
	}while(n!=6174&&n!=0)
	return 0;
}