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,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

思路

• 使用stoi()函数可以把字符串变成整数
• 使用to_string()函数可以把整数变成字符串
• 因为黑洞数的迭代次数必然不会太多，直接使用函数就能过

AC code

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;

string getReverse(string a){
    reverse(a.begin(),a.end());
    return a;
}
int main(){
    string a,b;
    int ans;
    cin >> a;
    do{
        sort(a.begin(),a.end(),greater<char>());
        while(a.size()<4) a.push_back('0');
        b = getReverse(a);
        ans = stoi(a)-stoi(b);
        printf("%s - %s = %04d\n",a.c_str(),b.c_str(),ans);
        a = to_string(ans);
    }while(ans!=0 and ans!=6174);
    return 0;
}