1069 The Black Hole

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

#include<cstdio>
#include<algorithm>
using namespace std;

bool cmp(int n1, int n2)
{
  return n1 > n2;
}

int trans1(int num)
{
  int array[4];
  for (int i = 3; i >= 0; i--)
  {
    array[i] = num % 10;
    num = num / 10;
  }
  sort(array, array + 4, cmp);
  int ans = 0;
  for (int i = 0; i < 4; i++)
  {
    ans = ans * 10 + array[i];
  }
  return ans;
}

int trans2(int num)
{
  int array[4];
  for (int i = 3; i >= 0; i--)
  {
    array[i] = num % 10;
    num = num / 10;
  }
  sort(array, array + 4);
  int ans = 0;
  for (int i = 0; i < 4; i++)
  {
    ans = ans * 10 + array[i];
  }
  return ans;
}

int main()
{
  int num;
  scanf_s("%d", &num);
  while (num != 0)
  {
    printf("%04d - %04d = %04d\n", trans1(num), trans2(num), trans1(num) - trans2(num));
    num = trans1(num) - trans2(num);
    if (num == 6174)
      break;
  }
}