POJ-1731-Orders

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define MAX 201
using namespace std;
char str[MAX],ita[MAX];
bool vis[MAX];
int len;
int main()
{
while(scanf("%s",str)!=EOF)
{
len=strlen(str);
sort(str,str+len);
printf("%s\n",str);
while(next_permutation(str,str+len))
printf("%s\n",str);
}
return 0;
}

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define MAX 201
using namespace std;
char str[MAX];
int len;
int main()
{
while(scanf("%s",str)!=EOF)
{
len=strlen(str);
sort(str,str+len);
printf("%s\n",str);
while(1)
{
int index=-1;
for(int i=len-1;i>0;i--)
if(str[i]>str[i-1])
{
index=i-1;
break;
}
if(index==-1)
break;
for(int i=len-1;i>=0;i--)
if(str[i]>str[index])
{
swap(str[i],str[index]);
int l=(len-index-1)/2;
for(int j=1;j<=l;j++)
swap(str[index+j],str[len-j]);
printf("%s\n",str);
break;
}
}
}
return 0;
}