1069. The Black Hole of Numbers (20)

最新推荐文章于 2020-01-21 17:45:17 发布

dayL_W

最新推荐文章于 2020-01-21 17:45:17 发布

阅读量219

点赞数

分类专栏： PAT甲级

本文链接：https://blog.csdn.net/u013181595/article/details/71577305

版权

PAT甲级专栏收录该内容

79 篇文章 0 订阅

订阅专栏

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

int a[4];
int x;
void to_arry(int num)
{
  for(int i=0; i<4; i++)
  {
    a[i] = num%10;
    num = num/10;
  }
     
}

int to_num(int a[],int x)
{
  int temp=0;
  if(x == 0)
  {
    for(int i=0; i<4; i++)
      temp = temp*10 + a[i];
  }
  else if(x == 1)
  {
    for(int i=3; i>=0; i--)
      temp = temp*10 + a[i];
  }
  return temp;
}
int main()
{
  int MAX=0,MIN=1,DEV=0;
  int num=0;
  scanf("%d",&num);
  while(1)
  {
    to_arry(num);
    sort(a,a+4);
    MAX = to_num(a,1);
    MIN = to_num(a,0);
    DEV = MAX - MIN;
    num = DEV;
    printf("%04d - %04d = %04d\n",MAX,MIN,DEV);
    if(DEV == 0 || DEV == 6174)
      break;
  }
  return 0;
}