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

AC代码

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

void Toarray(int num, int arr1[], int arr2[]){
	for(int i = 0; i < 4; i++){
		arr1[i] = num % 10;
		num  /= 10;
	}
	sort(arr1, arr1 + 4);
	for(int i = 0; i < 4; i++)
		arr2[3 - i] = arr1[i];
}

int Toint(int arr[]){
	int num = 0;
	for(int i = 0; i < 4; i++)
		num = num * 10 + arr[i];
	return num;
}

int main(){ 
	int a, b;
	cin>>a;
	int arr1[4], arr2[4];
	while(1){
		Toarray(a, arr1, arr2);
		a = Toint(arr1);
		b = Toint(arr2);
		printf("%04d - %04d = ", b, a);
		a = b - a;
		printf("%04d\n",a);
		if(a == 0 || a == 6174) break;
	}
	return 0;
}