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 <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <string>
#include <string.h>
using namespace std;
const int MAX = 1e4+10;
int n,a,b;
bool cmp(int a, int b){ return a>b;}
int inum(int x){
vector<int> v;
v.push_back(x/1000);
v.push_back(x/100%10);
v.push_back(x/10%10);
v.push_back(x%10);
sort(v.begin(), v.end());
return 1000*v[0]+100*v[1]+10*v[2]+v[3];
}
int dnum(int x){
vector<int> v;
v.push_back(x/1000);
v.push_back(x/100%10);
v.push_back(x/10%10);
v.push_back(x%10);
sort(v.begin(), v.end(), cmp);
return 1000*v[0]+100*v[1]+10*v[2]+v[3];
}
int main() {
scanf("%d", &n);
do{
a = dnum(n), b = inum(n), n = a - b;
printf("%04d - %04d = %04d\n", a, b, n);
}while(n!=0 && n!=6174);
scanf("%d",&n);
return 0;
}