PAT甲级 1069 The Black Hole of Numbers(20) (思维+模拟)

最新推荐文章于 2024-05-23 21:23:50 发布

NHS6671

最新推荐文章于 2024-05-23 21:23:50 发布

阅读量115

点赞数

分类专栏： PAT-甲级文章标签：职场和发展数据结构 c++ pat考试算法

本文链接：https://blog.csdn.net/NHS6671/article/details/125263593

版权

PAT-甲级专栏收录该内容

70 篇文章 0 订阅

订阅专栏

题目

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.

输入

Each input file contains one test case which gives a positive integer N in the range (0, $10^{4}$ ).

输出

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.

样例输入

样例输入1:

6767
样例输入2:

2222

样例输出

样例输出1:

7766 - 6677 = 1089
9810 - 0189 = 9621
9621 - 1269 = 8352
8532 - 2358 = 6174
样例输出2:

2222 - 2222 = 0000

题意理解

给你一个数你要将这个数重新排列比如样例1中

6767 先按照这个数的降序排列也就是排列成 7766 然后再升序排列 6677

然后两数想减然后得到的结果再继续排列相减

直到最后我们减出来的东西是 0 或者是 6174

题目大意就是让我们模拟这个过程将所有的步骤输出出来

不管最后怎么处理最后一定是能出来6174的这是一个结论

要注意的是如果这个数子没有到四位数我们要手动给这个数补上0

比如 189 就要输出 0189

剩下的就是模拟即可

代码

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int turn1(int x){
    vector<int>re;
    while(x){
        int nu=x%10;
        re.push_back(nu);
        x/=10;
    }
    while(re.size()<4)re.push_back(0);
    sort(re.begin(),re.end());
    int res=0;
    for(int i=0;i<4;i++){
        res=res*10+re[i];
    }
    return res;
}
int turn2(int x){
    vector<int>re;
    while(x){
        int nu=x%10;
        re.push_back(nu);
        x/=10;
    }
    while(re.size()<4)re.push_back(0);
    sort(re.begin(),re.end(),greater<int>());
    int res=0;
    for(int i=0;i<4;i++){
        res=res*10+re[i];
    }
    return res;
}
int main(){
    int x,y;
    cin>>x;
    while(1){
        x=turn1(x);y=turn2(x);
        int res=y-x;
        printf("%04d - %04d = %04d\n",y,x,res);
        if(res==0||res==6174)break;
        x=res;
    }
    return 0;
}