题目来源:PAT (Advanced Level) Practice
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
words:
manner 方式,方法 black hole 黑洞 illustrate 说明 equation 等式,方程式
题意:
将输入的任意一个四位数n(4位数字不完全相同)的数字先按照降序排列得到新的四位数a,再按照升序排列得到新的四位数b,计算a-b得到新的n,不断如此重复直到n等于6174;
思路:
1. 输入一个数n后不断进行模拟即可;当n输入的不是四位数时需要给前面补‘0’达到四位数;
2. 再模拟过程中若a==b,即n=0,此时停止模拟、输出”0000“结束;
3. 当一个数在输出时不满四位数,则前面补‘0’;
//1019 数字黑洞
#include <iostream>
using namespace std;
#include <algorithm>
#include <iomanip>
bool cmp(char x,char y) //递减排序
{
return x>y;
}
int num(string s) //将字符串s转化为数值形式
{
int ans=0;
while(!s.empty())
{
ans=ans*10+s[0]-'0';
s.erase(0,1);
}
return ans;
}
int main()
{
string s;
int a,b;
cin>>s; //以字符串的形式输入数n
do
{
while(s.size()<4) //若输入的数为[1,999],则补足为4位数
s="0"+s;
sort(s.begin(),s.end(),cmp); //递减排序
a=num(s);
sort(s.begin(),s.end()); //递增排序
b=num(s);
if(a==b)
s="0000";
else
s=to_string(a-b);
cout<<setw(4)<<setfill('0')<<a<<" - ";
cout<<setw(4)<<setfill('0')<<b<<" = ";
cout<<setw(4)<<setfill('0')<<s<<endl;
}while(s!="0000"&&s!="6174");
return 0;
}