PAT甲级 1069

题目 The Black Hole of Numbers

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.

解析

输入一个四位数，将四位数中的数字以增序减去降序的值，判断是否为0 或者6174.如果不是就按值的增序减去降序在判断一次，如果是就停止。

代码

#include<bits/stdc++.h>

#define INF 1<<29

void dfs(int number);

using namespace std;

void pat1069() {
    int number;
    cin >> number;
    dfs(number);
}

void dfs(int number) {
    int a[4] = {number % 10, number % 100 / 10, number % 1000 / 100, number / 1000};
    sort(a, a + 4);
    int min_number = a[0] * 1000 + a[1] * 100 + a[2] * 10 + a[3];
    int max_number = a[3] * 1000 + a[2] * 100 + a[1] * 10 + a[0];
    int res = max_number - min_number;
    switch (res){
        case 0:
        case 6174:
            printf("%04d - %04d = %04d\n",max_number,min_number,res);
            return;
        default:
            printf("%04d - %04d = %04d\n",max_number,min_number,res);
            dfs(res);
    }

}

int main() {
    pat1069();
    return 0;
}