Description
You are given nk-digit integers. You have to rearrange the digits in the integers so that the difference between the largest and the smallest number was minimum. Digits should be rearranged by the same rule in all integers.
Input
The first line contains integers n and k — the number and digit capacity of numbers correspondingly (1 ≤ n, k ≤ 8). Next n lines contain k-digit positive integers. Leading zeroes are allowed both in the initial integers and the integers resulting from the rearranging of digits.
Output
Print a single number: the minimally possible difference between the largest and the smallest number after the digits are rearranged in all integers by the same rule.
Sample Input
6 4 5237 2753 7523 5723 5327 2537
2700
3 3 010 909 012
3
7 5 50808 36603 37198 44911 29994 42543 50156
20522
Hint
In the first sample, if we rearrange the digits in numbers as (3,1,4,2), then the 2-nd and the 4-th numbers will equal 5237 and 2537 correspondingly (they will be maximum and minimum for such order of digits).
In the second sample, if we swap the second digits and the first ones, we get integers 100, 99 and 102.
直接暴力列举不会超时的
#include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
using namespace std;
string str[10];
int main()
{
int n,dig;
cin >> n >> dig;
for(int i=0; i < n; ++i)
cin >> str[i];
int arr[10];
int ar[10];
for(int i=0 ; i < dig; ++i)
arr[i]=i;
int min=1000000000;
do{
memset(ar,0,sizeof(ar));
for(int i=0; i < n; ++i){
for(int j=0; j < dig; ++j)
ar[i]=ar[i]*10+(str[i][arr[j]]-'0');
}
sort(ar,ar+n);
min=(ar[n-1]-ar[0]<min)?ar[n-1]-ar[0]:min;
}while(next_permutation(arr,arr+dig));
cout << min << endl;
}