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

代码

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

bool cmp1(int a, int b){
    return a > b;
}

bool cmp2(int a, int b){
    return a < b;
}

int trans(int n, int flag){
    vector<int> temp;
    for(int i=0; i<4; i++) {
        temp.push_back(n%10);
        n /= 10;
    }
    if(flag == 1)
        sort(temp.begin(), temp.end(), cmp1);
    else
        sort(temp.begin(), temp.end(), cmp2);
    int res = 0;
    for(int i=0; i<4; i++)
        res = res*10 + temp[i];
    return res;
}

int main(){
    int n, maxn, minn, temp;
    scanf("%d", &n);
    maxn = trans(n, 1);
    minn = trans(n, -1);
    if(maxn == minn){
        printf("%d - %d = 0000\n", maxn, minn);
    }
    else{
        temp = maxn - minn;
        while(temp != 6174){
            printf("%04d - %04d = %04d\n", maxn, minn, temp);
            maxn = trans(temp, 1);
            minn = trans(temp, -1);
            temp = maxn - minn;
        }
        printf("%04d - %04d = %04d\n", maxn, minn, temp);
    }
    return 0;
}