POJ 2718 （Smallest Different）

#include <iostream>
#include <algorithm>
#include <cstdio>

int n,ids;
int s[15];
char c;

using namespace std;

int make_num(int i,int j){
    int x=0;
    for(int k=i;k<j;k++){
        x*=10;
        x+=s[k];
    }
    return x;
}

void solve(){
    int ans=0x3f3f3f3f;
    int k=ids/2;

    do{
        if(s[0]==0||s[k]==0)    continue;

        int x=make_num(0,k);
        int y=make_num(k,ids);
        ans=min(ans,abs(x-y));
    }while(next_permutation(s,s+ids));
    printf("%d\n",ans);
}

// using namespace std;
int main(void){
    
    scanf("%d\n",&n);
    while(n--){
        ids=0;
        while((c=getchar())!=‘\n‘){
            if(c!=‘ ‘)    s[ids++]=c-‘0‘;
        }
        if(ids==1)
            cout<<s[0]<<endl;
        else if(ids==2)
            cout<<abs(s[0]-s[1])<<endl;
        else{solve();}        
    }
    // printf("%d\n",ids);
    return 0;
}