#1069. The Black Hole of Numbers【模拟】

原题链接

Problem Description：

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

Problem Analysis:

根据题意，所有的数一定是 $4$ 位整数，可以开一个大小为 $4$ 的数组，然后将每个整数的每一位数存入数组中，以方便进行升序和降序操作。当结果为 6174 或 0 时，即可结束操作。

详细步骤见代码。

Code

#include <iostream>
#include <algorithm>
#include <cstring>
#include <functional>

using namespace std;

int n, a, b;
int arr[4];

int to_num(int arr[])
{
    int sum = 0;
    for (int i = 0; i < 4; i ++ )
        sum = sum * 10 + arr[i];
    return sum;
}

void to_array(int num, int arr[])
{
    for (int i = 3; i >= 0; i -- )
    {
        arr[i] = num % 10;
        num /= 10;
    }
}

int main()
{
    int num;
    cin >> num;

    to_array(num, arr);
    int res = 0;

    for (int i = 0; i < 10; i ++ )
    {
        sort(arr, arr + 4, greater<int>()), a = to_num(arr);
        sort(arr, arr + 4), b = to_num(arr);
        res = a - b, to_array(res, arr);

        printf("%04d - %04d = %04d\n", a, b, res);
        if (res == 6174 || res == 0) break;
    }
    return 0;
}