poj 2718 Smallest Difference

#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#if 1
#define _my_abs_(a) ((a)<0?(-(a)):(a))
int t;
int d[20];
int arr2num(int *a,int len)
{
	int r=0;
	for (int i=0;i<len;i++)
	{
		r=r*10+a[i];
	}
	return r;
}
int main()
{
	freopen("poj2718_Smallest Difference.txt","r",stdin);
	scanf("%d\n",&t);
	int n;
	for (int i=0;i<t;i++)
	{
		char c;
		n=0;
		while (scanf("%c",&c)!=EOF)
		{
			if (c==' ')
			{
				continue;
			}
			if (c=='\n')
			{
				break;
			}
			d[n++]=c-'0';
		}
		int a=n/2,b=n-a;
		int ans=0x3f3f3f3f;
		int num1,num2;
		if (a==1&&b==1) //只有两个数的情况单独讨论
		{
			ans=_my_abs_(d[0]-d[1]);
		}
		else
		{
			do 
			{
				if (d[0]==0||d[a]==0)
				{
					continue;
				}
				num1=arr2num(d,a);
				num2=arr2num(d+a,b);
				if (ans>_my_abs_(num1-num2))
				{
					ans=_my_abs_(num1-num2);
				}
			} while (next_permutation(d,d+n));
		}		
		printf("%d\n",ans);
	}
	return 0;
}
#endif