【PAT】【Advanced Level】1069. The Black Hole of Numbers (20)

最新推荐文章于 2021-02-20 21:50:10 发布

old_杨

最新推荐文章于 2021-02-20 21:50:10 发布

阅读量224

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/oldyang95/article/details/77536308

版权

PAT 专栏收录该内容

132 篇文章 0 订阅

订阅专栏

1069. The Black Hole of Numbers (20)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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, 10000).

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:

Sample Output 1:

7766 - 6677 = 1089
9810 - 0189 = 9621
9621 - 1269 = 8352
8532 - 2358 = 6174

Sample Input 2:

Sample Output 2:

2222 - 2222 = 0000

原题链接：

https://www.patest.cn/contests/pat-a-practise/1069

https://www.nowcoder.com/pat/5/problem/4030

思路：

基础题。。

CODE：

#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cstdio>

using namespace std;

int cmp(int a,int b) 
{
	return a>b;	
}

int main()
{
	int a;
	cin>>a;
	int b[4];
	b[0]=a/1000;
	b[1]=a%1000/100;
	b[2]=a%100/10;
	b[3]=a%10;
	if (b[0]==b[1]&&b[1]==b[2]&&b[2]==b[3])
	{
		printf("%04d - %04d = %04d\n",a,a,0);
	}
	else
	{
		while (true)
		{
			sort(b,b+4,cmp);
			int s1=1000*b[0]+100*b[1]+10*b[2]+b[3];
			int s2=1000*b[3]+100*b[2]+10*b[1]+b[0];
			int c=s1-s2;
			printf("%04d - %04d = %04d\n",s1,s2,c);
			if (c==6174) break;
			b[0]=c/1000;
			b[1]=c%1000/100;
			b[2]=c%100/10;
			b[3]=c%10;
		}	
	}
	return 0;
}