1019 数字黑洞 (20)(20 分)
给定任一个各位数字不完全相同的4位正整数,如果我们先把4个数字按非递增排序,再按非递减排序,然后用第1个数字减第2个数字,将得到一个新的数字。一直重复这样做,我们很快会停在有“数字黑洞”之称的6174,这个神奇的数字也叫Kaprekar常数。
例如,我们从6767开始,将得到
7766 - 6677 = 1089\ 9810 - 0189 = 9621\ 9621 - 1269 = 8352\ 8532 - 2358 = 6174\ 7641 - 1467 = 6174\ ... ...
现给定任意4位正整数,请编写程序演示到达黑洞的过程。
输入格式:
输入给出一个(0, 10000)区间内的正整数N。
输出格式:
如果N的4位数字全相等,则在一行内输出“N - N = 0000”;否则将计算的每一步在一行内输出,直到6174作为差出现,输出格式见样例。注意每个数字按4位数格式输出。
输入样例1:
6767
输出样例1:
7766 - 6677 = 1089
9810 - 0189 = 9621
9621 - 1269 = 8352
8532 - 2358 = 6174
输入样例2:
2222
输出样例2:
2222 - 2222 = 0000
参考代码:
(我写的tm长,不要问我为什么用字符串处理数字。。我也不知道我怎么想的。注意题目虽然说输入一个四位数的正整数,但测试点输入仍会给出个位数或者三位数,如2,88,996而不是0002,0088,0996)
#include<iostream>
#include<string>
using namespace std;
void swap(char &a, char &b)
{
char temp;
temp = a;
a = b;
b = temp;
}
int turn1(string str)
{
int k;
int num1 = 0;
for (int i = 0; i < 4; i++)
{
switch (i)
{
case 0:
k = 1000;
break;
case 1:
k = 100;
break;
case 2:
k = 10;
break;
case 3:
k = 1;
break;
}
switch (str[i])
{
case '0':
break;
case '1':
num1 = num1 + k;
break;
case '2':
num1 = num1 + 2 * k;
break;
case '3':
num1 = num1 + 3 * k;
break;
case '4':
num1 = num1 + 4 * k;
break;
case '5':
num1 = num1 + 5 * k;
break;
case '6':
num1 = num1 + 6 * k;
break;
case '7':
num1 = num1 + 7 * k;
break;
case '8':
num1 = num1 + 8 * k;
break;
case '9':
num1 = num1 + 9 * k;
break;
}
}
return num1;
}
string turn2(int x,string str)
{
switch (x)
{
case 0:
str = str + "0";
break;
case 1:
str = str + "1";
break;
case 2:
str = str + "2";
break;
case 3:
str = str + "3";
break;
case 4:
str = str + "4";
break;
case 5:
str = str + "5";
break;
case 6:
str = str + "6";
break;
case 7:
str = str + "7";
break;
case 8:
str = str + "8";
break;
case 9:
str = str + "9";
break;
}
return str;
}
int main()
{
string str;
string str1, str2;
int num = 0;
cin >> str;
int count = str.size();
if (count < 4)
{
for (int i = 0; i < 4 - count; i++)
{
str = "0" + str;
}
}
if (str[0] == str[1]&&str[1] == str[2] &&str[2]== str[3])
cout << str << " - " << str << " = 0000" << endl;
else
{
int num1, num2;
int a, b, c, d;
string str3;
while (num != 6174)
{
str1 = str;
str2 = str;
for (int i = 0; i < 4; i++)//递增序
{
for (int j = i + 1; j < 4; j++)
{
if (str1[i] > str1[j])
swap(str1[i], str1[j]);
}
}
for (int i = 0; i < 4; i++)//递减序
{
for (int j = i + 1; j < 4; j++)
{
if (str2[i] < str2[j])
swap(str2[i], str2[j]);
}
}
cout << str2 << " - " << str1 << " = ";
num1 = turn1(str1);
num2 = turn1(str2);
num = num2 - num1;
a = num / 1000;
b = (num - a * 1000) / 100;
c = (num - a * 1000 - b * 100) / 10;
d = num % 10;
str3 = turn2(a, str3);
str3 = turn2(b, str3);
str3 = turn2(c, str3);
str3 = turn2(d, str3);
str = str3;
cout << str3 << endl;
str3 = "";
}
}
system("pause");
return 0;
}