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,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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void Deal(vector<int> vec)
{
sort(vec.begin(),vec.end());
int small=vec[0]*1000+vec[1]*100+vec[2]*10+vec[3];
int big=vec[3]*1000+vec[2]*100+vec[1]*10+vec[0];
int res=big-small;
printf("%04d - %04d = %04d\n",big,small,res);
if(res!=0&&res!=6174)
{
vector<int> v;
int num;
num=res%10;res/=10;
v.push_back(num);
num=res%10;res/=10;
v.push_back(num);
num=res%10;res/=10;
v.push_back(num);
num=res%10;res/=10;
v.push_back(num);
Deal(v);
}
}
int main()
{
vector<int> vec;
int n;
cin>>n;
int num;
num=n%10;n/=10;
vec.push_back(num);
num=n%10;n/=10;
vec.push_back(num);
num=n%10;n/=10;
vec.push_back(num);
num=n%10;n/=10;
vec.push_back(num);
Deal(vec);
return 0;
}