Smallest Difference(dfs+STL)

最新推荐文章于 2021-01-29 11:08:51 发布

csdn_PatrickStar

最新推荐文章于 2021-01-29 11:08:51 发布

阅读量258

点赞数

分类专栏： dfs/bfs

本文链接：https://blog.csdn.net/CSDN_PatrickStar/article/details/84483581

版权

dfs/bfs 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

Problem:Smallest Difference

Description:
Given a number of distinct decimal digits, you can form one integer by choosing a non-empty subset of these digits and writing them in some order. The remaining digits can be written down in some order to form a second integer. Unless the resulting integer is 0, the integer may not start with the digit 0.

For example, if you are given the digits 0, 1, 2, 4, 6 and 7, you can write the pair of integers 10 and 2467. Of course, there are many ways to form such pairs of integers: 210 and 764, 204 and 176, etc. The absolute value of the difference between the integers in the last pair is 28, and it turns out that no other pair formed by the rules above can achieve a smaller difference.

Input:
The first line of input contains the number of cases to follow. For each case, there is one line of input containing at least two but no more than 10 decimal digits. (The decimal digits are 0, 1, …, 9.) No digit appears more than once in one line of the input. The digits will appear in increasing order, separated by exactly one blank space.

Output:
For each test case, write on a single line the smallest absolute difference of two integers that can be written from the given digits as described by the rules above.

Sample Input:

1
0 1 2 4 6 7

Sample Output:

Language:C++

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#define INF 0x3f3f3f3f

using namespace std;

int n;
int num[11];
int ans;

void dfs()
{
  if(num[1]!=0&&num[n/2+1]!=0)
  {
    int a=0,b=0;
    for(int i=1;i<=n/2;i++) a=a*10+num[i];
    for(int j=n/2+1;j<=n;j++) b=b*10+num[j];
    if(fabs(a-b)<ans) ans=fabs(a-b);
  }
}

int main()
{
  int t;
  scanf("%d",&t);
  getchar();
  while(t--)
  {
    n=0;
    char c;
    while(scanf("%c",&c)&&c!='\n')
    {
      if(c!=' ')  num[++n]=c-'0';
    }

    if(n==2)  printf("%d\n",num[2]-num[1]);
    else
    {
      ans=INF; 
      
      do
      {
        dfs();
      }while(next_permutation(num+1,num+1+n));
      
      printf("%d\n",ans);
    }
  }
  return 0;
}