PAT (Advanced Level) 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, 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:

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

/*2015.7.28cyq*/
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int f(int &n){
	vector<int> data;
	data.push_back(n%10);
	data.push_back(n%100/10);
	data.push_back(n%1000/100);
	data.push_back(n/1000);
	sort(data.begin(),data.end());
	n=data[0]+data[1]*10+data[2]*100+data[3]*1000;
	return data[3]+data[2]*10+data[1]*100+data[0]*1000;
}
int main(){
	int N;
	cin>>N;
	vector<int> tmp;
	if(N==6174){
		printf("7641 - 1467 = 6174\n");
		return 0;
	}
	while(N!=6174){
		int a=f(N);
		int b=N-a;
		printf("%04d - %04d = %04d\n",N,a,b);
		N=b;
		if(N==0)
			break;
	}
	return 0;
}