POJ 2718 暴力枚举

#include <cstdio>#include <iostream>#include <algorithm>#include <queue>#include <stack>#include <climits>#include <cstring>#include <cmath>#include <map>#include <set>#include <cctype>using namespace std;int k = 0;int ans;int fi[1050];int se[1050];int flag[15];int num[15];void fun(int t){if(t == k){int qian = 0,hou = 0;int q[15],h[15]; for(int i = 0;i < k;i++){if(flag[i]){q[qian++] = num[i];}else{h[hou++] = num[i];}}if(abs(qian - hou) > 1) return ;sort(q,q+qian);int n = 0,m = 0;do{int tn = 0;if(q[0] == 0 && qian != 1) continue;for(int i = 0;i < qian;i++){tn *= 10;tn += q[i];}fi[n++] = tn;//cout << tn << endl;//cout << n << endl;}while(next_permutation(q,q+qian));do{int tn = 0;if(h[0] == 0 && hou != 1) continue;for(int i = 0;i < hou;i++){tn*=10;tn += h[i]; }se[m++] = tn;//cout << tn << endl;}while(next_permutation(h,h+hou));for(int i = 0;i < n;i++){for(int j = 0; j < m;j++){int g = abs(fi[i] - se[j]);if(g < ans){ans = g;}}}}else{flag[t] = 1;fun(t+1); flag[t] = 0;fun(t+1);}}int main(){int n;   //freopen("in.txt","r",stdin);   //freopen("2.txt","w",stdout);scanf("%d",&n);getchar();while(n --){char a[100];gets(a);k = 0;for(int i = 0;a[i];i++){if(isdigit(a[i])){num[k++] = a[i] - '0';}}memset(flag,0,sizeof(flag));ans = INT_MAX;fun(0);cout << ans << endl;} return 0;}