UVa 10098 - Generating Fast

#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<string>
using namespace std;
int c_cmp(const void *a,const void *b)
{
    return *(char *)a-*(char *)b;
}
int p_sort(char *s,int len)
{
    int flag=0,i,j;
    for(i=len-1; i>0; i--)
        if(s[i]>s[i-1])
        {
            flag=1;
            break;
        }
    if(flag==0)
        return 0;
    for(j=len-1; j>=i; j--)
        if(s[j]>s[i-1])
            break;
    int t=s[j];
    s[j]=s[i-1];
    s[i-1]=t;
    qsort(&s[i],len-i,sizeof(s[0]),c_cmp);
    cout<<s<<endl;
    return 1;
}
int main()
{
#ifdef test
    freopen("sample.txt","r",stdin);
#endif
    int num;
    char str[10+2];
    cin>>num;
    cin.get();
    while(num--)
    {
        cin.getline(str,11,'
');
        int flag=1,len=strlen(str);
        qsort(str,len,sizeof(str[0]),c_cmp);
        cout<<str<<endl;
        while(flag)
            flag=p_sort(str,len);
        cout<<endl;
    }
    return 0;
}