暴力枚举--数字组合问题求最小差值

Smallest Difference

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 20353		Accepted: 5518

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

28

Source

Rocky Mountain 2005

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;

const int MAX_LEN = 15;

int t;
char s[MAX_LEN];
int num[MAX_LEN];

int main() {
	scanf("%d", &t);
	getchar();
	while (t--) {
		int Res = 999999999;
		gets_s(s);
		int len = strlen(s);
		int k = 0;
		for (int i = 0; i < len; i++) {
			if (s[i] >= '0' && s[i] <= '9')
			{
				num[k++] = s[i] - '0';
			}
		}
		while (num[0] == 0) {
			next_permutation(num, num + k);
		}
		if (k == 2) {
			Res = abs(num[1] - num[0]);
			printf("%d\n", Res);
			continue;
		}
		do {
			int MidIndex = (k + 1) / 2;
			if (num[MidIndex] != 0) {
				int PreHalf = 0; int BehindHalf = 0;
				for (int i = 0; i < MidIndex; i++) {
					PreHalf = PreHalf * 10 + num[i];
				}
				for (int i = MidIndex; i < k; i++) {
					BehindHalf = BehindHalf * 10 + num[i];
				}
				Res = min(Res, abs(PreHalf - BehindHalf));
			}
		} while (next_permutation(num, num + k));
		printf("%d\n", Res);
	}
	system("pause");
	return 0;
}