PTA甲级 1069 The Black Hole of Numbers (C++)

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

Caution:

即使输入的是 6174 也要进行一步减法。

Solution:

// Talk is cheap, show me the code
// Created by Misidrection 2021-08-21 11:26:16
// All rights reserved.

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
    
    string a;
    cin >> a;
    while(a.length() < 4) a = "0" + a;

    if(a[0] == a[1] && a[1] == a[2] && a[2] == a[3]){
        printf("%s - %s = 0000\n", a.c_str(), a.c_str());
        return 0;
    }

    while(true){

        sort(a.begin(), a.end());
        int small = stoi(a);

        sort(a.begin(), a.end(), greater<char>());
        int big = stoi(a);

        a = to_string(big - small);
        while(a.length() < 4) a = "0" + a;

        printf("%04d - %04d = %s\n", big, small, a.c_str());

        if(a == "6174") break;
        
    }

    return 0;
}