【个人代码及思路】PAT甲级：1069 The Black Hole of Numbers (20分)

PAT (Advanced Level) Practice

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,104).

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<cstdio>
#include<algorithm>

using namespace std;

void Partition(int a, int bHole[]) {//将一个数的每个数位存进数组中
    for(int i = 0; i < 4; i++) {
        bHole[i] = a % 10;
        a /= 10;
    }
}

int toMaxNum(int bHole[]){//得到first
    int max = 0;
    for(int i = 3; i >= 0; i--) {
        max = max * 10 + bHole[i];
    }
    return max;
}

int toMinNum(int bHole[]){//得到second
    int min = 0;
    for(int i = 0; i < 4; i++) {
        min = min * 10 + bHole[i];
    }
    return min;
}

void holePrintf(int n, int bHole[]) {
    int first, second;
    Partition(n, bHole);
    sort(bHole, bHole+4);
    first = toMaxNum(bHole);
    second = toMinNum(bHole);
    n = first - second;
    printf("%04d - %04d = %04d", first, second, n);    //打印结果
    //只要不是0或者6174就递归调用打印程序
    if(n != 6174 && n) {
        printf("\n");
        holePrintf(n, bHole);
    }
}

int main() {
    int n;
    int bHole[10];
    scanf("%d", &n);
    holePrintf(n, bHole);    //调用打印程序
    return 0;
}

思路提示:

题目本身很简单，注意打印格式中不足补0