Pagini recente » Cod sursa (job #2599820) | Cod sursa (job #901289) | Cod sursa (job #3280416) | Cod sursa (job #1360324) | Cod sursa (job #204178)
Cod sursa(job #204178)
#include <stdio.h>
#include <string.h>
char s[1005];
int n,a[27];
int maxim (int ant)
{
int i,ii=0;
for (i=1; i<=26; ++i)
if (i!=ant)
if (a[i])
{
ii=i;
break;
}
--a[ii];
return ii;
}
void solve ()
{
int i,ant=0,max;
for (i=0; i<n; ++i)
a[s[i]-'a'+1]++;
for (i=1; i<=n; ++i)
{
max=maxim (ant);
ant=max;
printf ("%c",max+'a'-1);
}
}
int main ()
{
freopen ("ordine.in","r",stdin);
freopen ("ordine.out","w",stdout);
gets (s);
n=strlen(s);
solve ();
return 0;
}