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:
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
分析:使用do……while因为如果输入为6174时仍然需要循环一轮,用sprintf一定要%04d不然会有点出错,自己也可以测试出错误。使用string时可以用insert来填入缺少的0;
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
bool cmp(char c1, char c2) { return c1 > c2; }
int main() {
int n, minnum, maxnum;
scanf("%d", &n);
char str[5];
sprintf(str, "%04d", n);
do {
sort(str, str + 4, cmp);
sscanf(str, "%d", &maxnum);
sort(str, str + 4);
sscanf(str, "%d", &minnum);
int num = maxnum - minnum;
printf("%04d - %04d = %04d\n", maxnum, minnum, num);
sprintf(str, "%04d", num);
} while (strcmp(str, "6174") != 0 && strcmp(str, "0000"));
return 0;
}
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
bool cmp(char a, char b) {
return a > b;
}
int main() {
string num;
cin >> num;
num.insert(0, 4 - num.length(), '0');
do {
string max = num, min = num;
sort(max.begin(), max.end(), cmp);
sort(min.begin(), min.end());
int res = stoi(max) - stoi(min);
num = to_string(res);
num.insert(0, 4 - num.length(), '0');
cout << max << " - " << min << " = " << num << endl;
} while (num != "6174" && num != "0000");
return 0;
}