【C++】PAT(advanced level )1069. The Black Hole of Numbers (20)-CSDN博客

本文链接：https://blog.csdn.net/artemisrj/article/details/20445123

本文通过示例解释了如何从一个4位数开始，通过排序其数字并计算差值，最终到达被称为'黑洞'的4位数6174，即Kaprekar常数。对于输入的4位数，展示了逐步计算直至得到6174的过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1069. The Black Hole of Numbers (20)

时间限制

100 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

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:

Sample Output 1:

7766 - 6677 = 1089
9810 - 0189 = 9621
9621 - 1269 = 8352
8532 - 2358 = 6174

Sample Input 2:

Sample Output 2:

2222 - 2222 = 0000

和中文题相同1019. 数字黑洞 (20)