/******************************************************************
*** Problem : ***
*** Author : Shipu Ahamed (Psycho Timekiller) ***
*** E-mail : shipuahamed01@gmail.com ***
*** University : BUBT,Dept. of CSE ***
*** Team : BUBT_Psycho ***
*** My Blog : http://shipuahamed.blogspot.com ***
*** Facebook : http://www.facebook.com/DeesheharaShipu ***
******************************************************************/
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std;
#define pi 2*acos(0.0)
#define all(v) v.begin(),v.end()
#define coff ios_base::sync_with_stdio(0);
#define ff first
#define se second
#define pb push_back
#define sz(a) ((int)a.size())
#define ST(v) sort(all(v))
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define maxall(v) *max_element(all(v))
#define minall(v) *min_element(all(v))
#define cover(a,d) memset(a,d,sizeof(a))
#define popcount(i) __builtin_popcount(i) //count one. in long long use __builtin_popcountll(i)
#define parity(i) __builtin_parity(i) //evenparity 0 and odd parity 1
#define btz(a) __builtin_ctz(a) //count binary trailling zero
#define un(v) ST(v), (v).erase(unique(all(v)),v.end())
#define common(a,b) ST(a), ST(b), a.erase(set_intersection(all(a),all(b),a.begin()),a.end())
#define uncommon(a,b) ST(a), ST(b), a.erase(set_symmetric_difference(all(a),all(b),a.begin()),a.end())
typedef long long ll;
typedef unsigned long long ull;
template string toString( T Number ){stringstream st;st << Number;return st.str();}
int stringconvert(string s){int p; istringstream st(s); st>>p ; return p;}
//upper bound and lower bound
#define LB(a,value) (lower_bound(all(a),value)-a.begin())
#define UB(a,value) (upper_bound(all(a),value)-a.begin())
//Debug
#define dbg(x) cout<<#x<<'='<>= 1; } return res; }
ll modInverse(ll a, ll m){return bigmod(a,m-2,m);}
////============ CONSTANT ===============////
#define inf 1<<30 //infinity value
#define eps 1e-9
#define mx 100010
#define mod 1000000007
////=====================================////
int main()
{
coff;
//input;
//output;
string s;
while(cin>>s)
{
if(s[0]=='#') break;
int len=sz(s);
int f=1,u,v,g[30][30],visit[30];
string ord="";
cover(g,0);
cover(visit,0);
for(int i=0;irsek)
{
res=rsek;
result=ord;
}
}
while(next_permutation(ord.begin(),ord.end()));
for(int i=0;i "<
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/140/140.cpp