给定任一个各位数字不完全相同的 4 位正整数,如果我们先把 4 个数字按非递增排序,再按非递减排序,然后用第 1 个数字减第 2 个数字,将得到一个新的数字。一直重复这样做,我们很快会停在有“数字黑洞”之称的 6174
,这个神奇的数字也叫 Kaprekar 常数。
例如,我们从6767
开始,将得到
7766 - 6677 = 1089
9810 - 0189 = 9621
9621 - 1269 = 8352
8532 - 2358 = 6174
7641 - 1467 = 6174
... ...
现给定任意 4 位正整数,请编写程序演示到达黑洞的过程。
#include <iostream>
#include <algorithm>
using namespace std;
void divid(int rel, int num[4]);
int main() {
int num[4] = { 0 };
int tmpnum;
cin >> tmpnum;
divid(tmpnum, num);
sort(num, num + 4, greater<int>());
int num1 = num[0] * 1000 + num[1] * 100 + num[2] * 10 + num[3];
if (num[0] == num[1] && num[1] == num[2] && num[3] == num[2]) {
cout << num1 << " - " << num1 << " = 0000" << endl;
return 0;
}
int num2 = num[3] * 1000 + num[2] * 100 + num[1] * 10 + num[0];
int result = 0;
result = num1 - num2;
for (auto i : num) {
cout << i;
}
cout << " - " ;
for (int i = 3; i >= 0; i--) {
cout << num[i];
}
cout << " = ";
divid(result, num);
for (int i = 3; i >= 0; i--) {
cout << num[i];
}
cout<< endl;
while (1) {
divid(result, num);
sort(num, num + 4, greater<int>());
num1 = num[0] * 1000 + num[1] * 100 + num[2] * 10 + num[3];
num2 = num[3] * 1000 + num[2] * 100 + num[1] * 10 + num[0];
int tmprel = num1 - num2;
if (tmprel == result) break;
result = tmprel;
for (auto i : num) {
cout << i;
}
cout << " - " ;
for (int i = 3; i >= 0; i--) {
cout << num[i];
}
cout << " = ";
divid(result, num);
for (int i = 3; i >= 0; i--) {
cout << num[i];
}
cout << endl;
}
}
void divid(int rel, int num[4]) {
for (int i = 0; i < 4; i++) {
num[i] = rel % 10;
rel /= 10;
}
}
改进后:
#include <iostream>
#include <string>
#include <algorithm>
bool cmp(char a, char b) {
return a > b;
}
bool cmp2(char a, char b) {
return b > a;
}
using namespace std;
int main() {
string s1;
cin >> s1;
s1.insert(0, 4 - s1.length(), '0');
int cnt = 0;
if (s1[0] == s1[1] && s1[1] == s1[2] && s1[2] == s1[3]) {
cout << s1 << " - " << s1 << " = " << "0000" << endl;
return 0;
}
while (1) {
string a, b;
a = b = s1;
sort(a.begin(),a.end(),cmp);
sort(b.begin(), b.end(),cmp2);
int result = stoi(a) - stoi(b);
if (result == 6174) cnt++;
if (cnt == 2) break;
s1 = to_string(result);
s1.insert(0, 4 - s1.length(), '0');
cout << a << " - " << b << " = " << s1 << endl;
}
return 0;
}
其中用到函数:
insert:用法一:s1.insert(string::size_type i,string str);//在i位置之前插入str字符串。
用法二:s1.insert(string::size_type i,int n,char ch);//在i位置之前插入n个ch字符
sort(): 头文件 #include <algorithm>
sort(begin,end,cmp);
sort详解http://t.csdn.cn/u5HWI
stoi():stoi(const string*)//将字符串转换为int,会检查是否越界
to_string:to_string(int num)//将int转换为字符串