牛客网PAT练兵场-数字黑洞

题解：循环即可

题目地址：https://www.nowcoder.com/questionTerminal/2e6a898974064e72ba09d05a60349c9e

 /**
 * Copyright(c)
 * All rights reserved.
 * Author : Ycute
 * Date : 2019-10-31-16.37.32
 * Description : 模拟输出
 */
 #include<iostream>
 #include<cstdio>
 #include<cmath>
 #include<cstring>
 #include<algorithm>
 using namespace std;

 //降序
 int cmp0(int a,int b){
     return a>b;
 }
 //升序
 bool cmp1(int a,int b){
     return a<b;
 }
 int main(){
     int in[];
     int temp[];
     int p;
     scanf("%d",&p);
     //scanf("%1d%1d%1d%1d",&in[0],&in[1],&in[2],&in[3]);
     temp[]=in[]=p/;
     temp[]=in[]=p/%;
     temp[]=in[]=p%/;
     temp[]=in[]=p%;
     while(){
         if(in[]==in[]&&in[]==in[]&&in[]==in[]){
             printf("N - N = 0000\n");
             break;
         }
         int t1[];
         int t2[];
         t1[]=temp[];
         t1[]=temp[];
         t1[]=temp[];
         t1[]=temp[];
         t2[]=temp[];
         t2[]=temp[];
         t2[]=temp[];
         t2[]=temp[];
         sort(t1,t1+,cmp0);
         sort(t2,t2+,cmp1);
         int num0=t1[]*+t1[]*+t1[]*+t1[];
         int num1=t2[]*+t2[]*+t2[]*+t2[];
         int num2=num0-num1;
         temp[]=num2/;
         temp[]=num2/%;
         temp[]=num2%/;
         temp[]=num2%;
         printf("%d%d%d%d - %d%d%d%d = %d%d%d%d\n",t1[],t1[],t1[],t1[],t2[],t2[],t2[],t2[],temp[],temp[],temp[],temp[]);
         if(temp[]==&&temp[]==&&temp[]==&&temp[]==) break ;
     }
     return ;
 }