1069.The Black Hole of Numbers (20)

最新推荐文章于 2021-11-30 12:59:59 发布

风怜目尽无疆地s

最新推荐文章于 2021-11-30 12:59:59 发布

阅读量290

点赞数

分类专栏： pat

本文链接：https://blog.csdn.net/ymdq1113/article/details/54755731

版权

pat 专栏收录该内容

163 篇文章 0 订阅

订阅专栏

1069.The Black Hole of Numbers (20)

pat-al-1069

2017-01-27

乙级就写过这题，这次再写就优化了一下
排序直接使用了sort
使用sprintf和sscanf进行字符串和数字之间的转换
坑见注释

/**
 * pat-al-1069
 * 2017-01-27
 * Cpp version
 * Auhtor: fengLian_s
 */
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
bool cmp1(char a, char b)
{
  return a > b;
}
bool cmp2(char a, char b)
{
  return a < b;
}
int main()
{
  int n;
  scanf("%d", &n);
  char num[5];//坑：4的话会出错
  sprintf(num, "%04d", n);//坑：注意格式控制
  //printf("n = %d\n", n);
  do {
    int max, min;
    sprintf(num, "%04d", n);
    //printf("n = %d\n", n);
    if(num[0] == num[1] && num[0] == num[2] && num[0] == num[3])
    {
      printf("%d - %d = 0000\n", n, n);
      return 0;
    }
    sort(num, num+4, cmp1);
    //printf("num = %s\n", num);
    sscanf(num, "%d", &max);
    //cout << "max = " << max << endl;
    sort(num, num+4, cmp2);
    sscanf(num, "%d", &min);
    //cout << "min = " << min << endl;
    n = max - min;
    printf("%04d - %04d = %04d\n", max, min, n);
  } while(n != 6174);
}