uva 10132 - File Fragmentation

#include <cstdio>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <queue>
#include <stack>
#include <cmath>
#include <string>
#include <iostream>
#include <map>
#include <algorithm>
using namespace std;
#define maxn 100 + 10
#define INF 2100000000
#define ll long long
string s[150];
int n, len;
int cmp(string a, string b)
{
    return a.size() < b.size();
}
bool ok(string str)
{
    bool vis[1100];
    memset(vis, false, sizeof(vis));
    for(int k = 0; k < (n+1)/2; ++k)
    {
        vis[k] == true;
        bool found = false;
        for(int l = n-1; l >= 0; --l)
        {
            if(!vis[l] && (str == s[k]+s[l] || str == s[l]+s[k]))
            {
                vis[l] = true;
                found = true;
                break;
            }
        }
        if(!found) return false;
    }
    return true;
}
int main()
{
    int t;
    scanf("%d", &t);
    getchar();
    getchar();
    while(t--)
    {
        n = 0;
        while(getline(cin, s[n]))
        {
            if(s[n][0] == '\0') break;
            ++n;
        }
        sort(s, s+n, cmp);
        string ans;
        bool OK = false;
        len = s[0].size() + s[n-1].size();
        for(int i = 0; s[i].size() == s[0].size(); ++i)
        {
            if(OK) break;
            for(int j = n-1; s[j].size() == s[n-1].size(); --j)
            {
                if(len == s[i].size()+s[j].size())
                {
                    string tmp = s[i] + s[j];
                    if(ok(tmp)) {OK = true; ans = tmp; break;}
                    tmp = s[j] + s[i];
                    if(ok(tmp)) {OK = true; ans = tmp; break;}
                }
            }
        }
        cout << ans << endl;
        if(t) puts("");
    }
    return 0;
}