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
Sample Input 2:
2222
Sample Output 2:
2222 - 2222 = 0000
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int main(){
char s[10];
int n;
cin >> n;
sprintf(s, "%04d", n);
do{sort(s, s + 4);
char temp[10];
strcpy(temp, s);
reverse(temp, temp + 4);
int x = (temp[0] - s[0]) * 1000 + (temp[1] - s[1]) * 100 + (temp[2] - s[2]) * 10 + (temp[3] - s[3]);
printf("%s - %s = %04d\n", temp, s, x);
sprintf(s, "%04d", x);
}while( strcmp(s, "6174") != 0 && strcmp(s, "0000") != 0 );
return 0;
}