UVA 10391

#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
#include<cstdio>

using namespace std;

int main()
{
 vector<string>v;
 string shobdo;
 string fs;
 string ss;
 int n,m;
 
 while(cin>>shobdo)
 {
  v.push_back(shobdo);
  }
 
 sort(v.begin(),v.end());
 
 for(int i=0; i<v.size(); i++)
 {
  if(v[i].size()==1) continue;
  
  for(int j=1; j<v[i].size(); j++)
  {
   fs=v[i].substr(0,j);
   ss=v[i].substr(j,v[i].size()-1);
   
   if((binary_search(v.begin(),v.end(),fs)) && (binary_search(v.begin(),v.end(),ss)))
   {
     cout<<v[i]<<endl;
     break;
   }
    
  }
  
 }

 return 0;
}

STL next_permutation(array,array+size)

#include<bits/stdc++.h>

using namespace std;

int main()
{
 char a[10];
 int l;
 cin>>a;
 l=strlen(a);
 sort(a,a+l);
 do{
  cout<<a<<endl;
 }
 while(next_permutation(a,a+l));
 return 0;
}

UVA 10098

#include<bits/stdc++.h>

using namespace std;

int main()
{
 char a[11];
 int n;
 
 while(cin>>n)
 {
  while(n--)
  {
   cin>>a;
   int l = strlen(a);
   sort(a,a+l);
   
   do{
    cout<<a<<endl;
   }
   while(next_permutation(a,a+l));
   cout<<endl;
   
  }
 }
 
 return 0;
}