PAT_1019_数字黑洞

PAT_1019_数字黑洞

题目链接

代码

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

bool up(int a, int b){
    return a < b;
}

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

int main()
{
    int N, digit[4];
    scanf("%d", &N);

    do{
        for(int i = 0; i < 4; i++){
            digit[i] = N % 10;
            N /= 10;
        }
        sort(digit, digit + 4, up);
        int up_num = digit[0] + digit[1]*10 + digit[2]*100 + digit[3]*1000;
        sort(digit, digit + 4, down);
        int down_num = digit[0] + digit[1]*10 + digit[2]*100 + digit[3]*1000;
        N = up_num - down_num;
        printf("%04d - %04d = %04d\n", up_num, down_num, N);

    }while(N != 6174 && N != 0);
    return 0;
}