1069. The Black Hole of Numbers (20)

1. 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:
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

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <fstream>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;

void strReverse(char s[],char d[], int n)
{
    int index = 0;
    for (; index < n - 1; ++index)
        d[n - index - 2] = s[index];
    d[index] = 0;
}

int main()
{
#ifdef _DEBUG
    //freopen("data.txt", "r+", stdin);
    fstream cin("data.txt");
#endif // _DEBUG
    char Num1[5],Num2[5];
    int Num, tmp1, tmp2;
    cin >> Num;
    if (Num == 6174) //特判
        printf("7641 - 1467 = 6174");
    while (Num && Num != 6174)
    {
        sprintf(Num1, "%04d", Num);
        sort(Num1, Num1 + 4);
        strReverse(Num1,Num2,5);
        sscanf(Num1, "%d", &tmp1);
        sscanf(Num2, "%d", &tmp2);
        printf("%04d - %04d = %04d\n", tmp2, tmp1, tmp2 - tmp1);
        Num = tmp2 - tmp1;
    }


#ifdef _DEBUG
    cin.close();
#ifndef _CODEBLOCKS
    system("pause");
#endif // !_CODEBLOCKS
#endif // _DEBUG

    return 0;
}