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>//AC
#include<string>
#include<algorithm>
using namespace std;
int main() {
int n;
cin >> n;
do {
while (n / 1000 == 0) { n *= 10; }
string s = to_string(n);
sort(s.begin(), s.end());
string str = s;
reverse(s.begin(), s.end());
n = atoi(s.c_str()) - atoi(str.c_str());
printf("%s - %s = %04d\n", s.c_str(), str.c_str(), n);
} while (n != 6174 && n != 0);//n=6174时也要输出,故用do while;!!!
return 0;
}