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, 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:6767Sample Output 1:
7766 - 6677 = 1089 9810 - 0189 = 9621 9621 - 1269 = 8352 8532 - 2358 = 6174Sample Input 2:
2222Sample Output 2:
2222 - 2222 = 0000
#include <stdio.h> #include <algorithm> using namespace std; bool cmp(int a, int b) { return a > b; } int main() { int i; int sum1, sum2, pre, sum, cnt; int str1[5], str2[5]; pre = -1; scanf("%d", &sum); cnt = 1000; for(i = 0; i < 4; i++) { str1[i] = sum / cnt; str2[i] = str1[i]; sum = sum % cnt; cnt = cnt / 10; } while(1) { sort(str1, str1 + 4, cmp); for(i = 0, sum1 = 0; i < 4; i++) sum1 = sum1 * 10 + str1[i]; sort(str2, str2 + 4); for(i = 0, sum2 = 0; i < 4; i++) sum2 = sum2 * 10 + str2[i]; sum = sum1 - sum2; if(sum == pre) break; printf("%04d - %04d = %04d\n", sum1, sum2, sum); pre = sum; cnt = 1000; for(i = 0; i < 4; i++) { str1[i] = sum / cnt; str2[i] = str1[i]; sum = sum % cnt; cnt = cnt / 10; } } return 0; }