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

本题考查的为类型转换，在这儿一定要安利一下stringstream这个类，用流的思想解决～

#include<iostream>
#include<vector>
#include<sstream>
#include<algorithm>
using namespace std;
bool cmp(char a, char b){

    return a > b;
}
int main(){

    string s;
    stringstream ss;
    cin >> s;

    if(s[0] == s[1] && s[1] == s[2] && s[2] == s[3]){
        printf("%s - %s = 0000\n", s.c_str(), s.c_str());
    }else
    {
        if(s == "6174"){
            sort(s.begin(), s.end(), cmp);
            int a;
            ss << s;
            ss >> a;
            ss.clear();
            sort(s.begin(), s.end());
            int b;
            ss << s;
            ss >> b;
            ss.clear();
            printf("%04d - %04d = %04d\n", a, b, a - b);
            return 0;
        }
        while (s.length() < 4){
        s += "0";
        }
        int  i = 0;
        while (s != "6174")
        {
            sort(s.begin(), s.end(), cmp);
            int a;
            ss << s;
            ss >> a;
            ss.clear();
            sort(s.begin(), s.end());
            int b;
            ss << s;
            ss >> b;
            ss.clear();
            printf("%04d - %04d = %04d\n", a, b, a - b);
            ss << a - b;
            ss >> s;
            while (s.length() < 4){
            s += "0";
            }
            ss.clear();
        }
        
       

    }
    
    
    
    

    return 0;
}