PAT1019 数字黑洞

#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int Num(int a[4]){
    int sum = 0;
    for(int i = 0;i<4;i++){
        sum = sum*10 + a[i];
    }
    return sum;
}

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

void ans(int & N,int & n1,int & n2)
{
    int i = 0;
    int a[4];
    memset(a,0,sizeof(a));
    int t = N;
    while(N){
        a[i++] = N%10;
        N/=10;
    }
    sort(a,a+4,cmp);
    n1 = Num(a);
    sort(a,a+4);
    n2 = Num(a);
    N = t;
}

bool isSame(int n)
{
    int a[4];
    memset(a,0,sizeof(a));
    int i = 0;
    while(n){
        a[i++] = n%10;
        n/=10;
    }
    int ok = 1;
    for(int i = 1;i<4;i++)
    {
        if(a[i]!=a[i-1]){
            ok = 0;
            return false;
        }
    }
    return true;
}

int main()
{
    int N;
    int n1, n2;
    cin>>N;
    int result = 0;

    do{
        int ok = isSame(N);
        if(ok){
            printf("%04d - %04d = %04d\n",N,N,0);
            break;
        }
        ans(N,n1,n2);
        result = n1-n2;
        printf("%04d - %04d = %04d\n",n1,n2,result);
        N = result;
    }while(N!=6174);

    return 0;
}
/**
6767
**/