PAT A1069 The Black Hole of Numbers (20分)-CSDN博客

本文链接：https://blog.csdn.net/VictorierJwr/article/details/104237143

A1069 The Black Hole of Numbers (20分)

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,10
4
).

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

做差结果可以用一个哈希表记录第二次出现循环结束

#include <cstdio>
#include <algorithm>
using namespace std;
int number(int *num,int len)
{
	int m = 0;
	for (int i = 0; i<len; i++)
	{
		m = m * 10 + num[i];
	}
	return m;
}
bool cmp(int a, int b)
{
	return a > b;
}
int main()
{
	int num[4], hashtable[10000] = {0};
	int n;
	scanf("%d", &n); 
	int n1 = 0;
	while (n != 0)
	{
		num[n1++] = n % 10;
		n /= 10;
	}
	int max, min;
	sort(num, num + 4);
	min = number(num, 4);
	sort(num, num + 4, cmp);
	max = number(num, 4);
	while (max - min != 0 && hashtable[max - min] == 0)
	{
		int m = max - min, k = 0;
		printf("%04d - %04d = %04d\n", max, min, max - min);
		hashtable[max - min] = 1;
		while (m != 0)
		{
			num[k++] = m % 10;
			m /= 10;
		}
		sort(num, num + 4);
		min = number(num, 4);
		sort(num, num + 4, cmp);
		max = number(num, 4);
	}
	if (max - min == 0)
	{
		printf("%04d - %04d = %04d\n", max, min, max - min);
	}
	return 0;
}