1019. 数字黑洞 (20)
时间限制
100 ms
内存限制
65536 kB
代码长度限制
8000 B
判题程序
Standard
作者
CHEN, Yue
给定任一个各位数字不完全相同的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
#include <iostream>
#include<algorithm>
#include<sstream>
using namespace std;
#include <stdlib.h>
#include <string>
bool compare(char a, char b) {
return a > b;
}
int main()
{
string s;
string s1;
string s2;
stringstream stream;
int t1, t2;
int i, j, k;
cin >> s;
stream << s;
stream >> t1;
stream.clear();
t1 += 10000;
stream << t1;
stream >> s;
s.erase(0, 1);
stream.clear();
s1 = s;
s2 = s1;
sort(s1.begin(), s1.end());
sort(s2.begin(), s2.end(),compare);
if (s1 == s2)
cout << s1 << " - " << s1 << " = " << "0000" << endl;
else {
if (s == "6174") {
s2 = s;
s1 = s;
sort(s1.begin(), s1.end());
sort(s2.begin(), s2.end(), compare);
cout << s2 << " - " << s1 << " = " << s << endl;
}
else {
while (s != "6174"&&s1 != s2) {
stream<<s1;
stream >> t1;
stream.clear();
stream << s2;
stream >> t2;
stream.clear();
t1 = t2 - t1;
t1 += 10000;
stream << t1;
stream >> s;
s.erase(0,1);
stream.clear();
cout << s2 << " - " << s1 << " = " << s << endl;
s2 = s;
s1 = s;
sort(s1.begin(), s1.end());
sort(s2.begin(), s2.end(), compare);
}
if (s1 == s2)
cout << s1 << " - " << s1 << " = " << "0000" << endl;
}
}
}
感想:好好理解sstream头文件