Smallest Difference POJ - 2718

人一我百！人十我万！永不放弃~~~怀着自信的心，去追逐梦想
全排列穷举搜索.

1. 两个数位数越接近,差的绝对值越小,所以从mid将排列拆成两个数.
2. 每次全排列穷举即可.next_permutation(num, num+len).
3. 注意的一个数为0的情况.

#include <iostream>
#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>
#define mod 1000000007
#define eps 1e-6
#define ll long long
#define INF 0x3f3f3f3f
#define MEM(x,y) memset(x,y,sizeof(x))
#define Maxn 1005
using namespace std;
int n;
int num[15];
int len;

void solve()
{
	while(n--)
	{
		len = 0;
		char ch;
		while(1)
		{
			scanf("%d%c", &num[len ++], &ch);
			if(ch == '\n')
				break;
		}
		if(len == 2) 
		{
			   cout << abs(num[0] - num[1]) << endl;
			   continue;
		}
		int n1, n2;
		int ans = INF;
		int mid = len/2;
		do
		{
			n1 = num[0];
			n2 = num[mid];
			if(n1 == 0 || n2 == 0)  continue;
			for(int i = 1; i < mid; i++)
				n1 = n1*10 + num[i];
		        for(int i = mid+1; i < len; i++)
				n2 = n2*10 + num[i];
			ans = min(ans, abs(n1 - n2));	
		}
		while(next_permutation(num, num+len));
		cout << ans << endl;
	}
}

int main()
{
	scanf("%d", &n);
	solve();
	return 0;
}