PAT甲级——1069 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

思路：有5个点 整数变数组 数组变整数 递增排序 递减排序 格式化输出
排序相关内容可看我另一博客：算法笔记杂记2——排序

#include <cstdio>
#include <algorithm>
using namespace std;



void m_Array(int a,int array[]) {
	for (int i = 0; i < 4; i++) {
		array[i] = a % 10;
	
		a /= 10;
	}
}
int m_Int(int array[]) {
	int a=0;
	int b = 1;
	for (int i = 0; i < 4; i++) {
		a += array[i]*b;
		b *= 10;
	}
	
	return a;
}
bool cmp(int a, int b) {
	return a > b;
}
int main() {
	int n = 0;
	int array[4] = { 0 };
	scanf("%d",&n);
	do{
		int n1, n2;
		m_Array(n, array);
		sort(array, array + 4);
		n1 = m_Int(array);
		sort(array, array + 4, cmp);
		n2 = m_Int(array);
		n = n1 - n2;
		printf("%04d - %04d = %04d\n", n1, n2, n);
	}while (n != 0 && n != 6174);
	system("pause");
	return 0;

}