1069 The Black Hole of Numbers

注意此组测试数据：

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

int num[10];

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

void divide(int n){
    for(int i=3;i>=0;i--){
        num[i]=n%10;
        n/=10;
    }
}

int merge(){
    int n=0;
    for(int i=0;i<4;i++){
        n=n*10+num[i];
    }
    return n;
}

int main(void){
    int n;
    scanf("%d",&n);
    do{
        divide(n);
        sort(num,num+4,cmp);
        int n1=merge();
        sort(num,num+4);
        int n2=merge();
        n=n1-n2;
        printf("%04d - %04d = %04d\n",n1,n2,n);
    }while(n!=6174 && n!=0);
    return 0;
}