Smallest Difference POJ

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

28

百度翻译：

给定一组不同的十进制数字，您可以通过选择这些数字的非空子集并按一定顺序写入来形成一个整数。剩下的数字可以按某种顺序写下来形成第二个整数。除非得到的整数为0，否则整数不能以数字0开头。 例如，如果给定数字0、1、2、4、6和7，则可以编写整数对10和2467。当然，形成这样的整数对有很多种方法：210和764、204和176等，最后一对中的整数之差的绝对值是28，结果表明，由上述规则形成的其他对都不能达到较小的差。

思路：由于输入的数据并不大，可以用全排列（next_permutation）的方式去写，将排列后的数分为前半部分和后半部分，
求出两部分的差的最小值。即为答案。注意输入只有两个数的情况和去除排列时以0为开头的排列。

#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <iostream>
#define mod 1000000007
#define eps 1e-6
#define ll long long
#define INF 0x3f3f3f3f
using namespace std;

int t;
string str;
int sz[15];
int main()
{
    cin>>t;
    getchar();
    while(t--)
    {
        getline(cin,str);
        int ans=0;
        for(int i=0;i<str.size();i++)
        {
            if(str[i]>='0'&&str[i]<='9')
            {
                sz[ans]=str[i]-'0';
                ans++;
            }
        }
        if(ans==2)//只有两个数时
        {
            cout<<abs(sz[1]-sz[0])<<endl;
            continue;
        }
        while(sz[0]==0)//不能以0开头
        {
            next_permutation(sz,sz+ans);
        }
        int ma=999999999;
        do{
            int mid=(ans+1)/2;
            if(sz[mid])
            {
                int a=0,b=0;
                for(int i=0;i<mid;i++)
                {
                    a=a*10+sz[i];
                }
                for(int i=mid;i<ans;i++)
                {
                    b=b*10+sz[i];
                }
                ma=min(ma,abs(a-b));
            }
        }while(next_permutation(sz,sz+ans));
        cout<<ma<<endl;
    }
}