Pagini recente » Cod sursa (job #109257) | Cod sursa (job #352559) | Cod sursa (job #2322173) | Cod sursa (job #793248) | Cod sursa (job #526965)
Cod sursa(job #526965)
#include <iostream>
#include <cstdio>
#include <stdio.h>
using namespace std;
int n,ma;
char T[1000005];
int i,j;
int A[40];
int urm(int de_unde)
{
int i;
for (i=de_unde+1;i<=40;i++)
if (A[i])
return i;
return 0;
}
int main()
{
freopen("ordine.in","r",stdin);
freopen("ordine.out","w",stdout);
gets(T);
n=strlen(T);
for (i=0;i<=n;i++)
A[T[i]-'a'+1]++;
i=urm(0);
j=urm(i);
if (j==0)
while (A[i])
{
printf("%c",i+'a'-1);
A[i]--;
}
ma=j;
while (ma!=0)
{
while (A[i] && A[j])
{
printf("%c",i+'a'-1);
printf("%c",j+'a'-1);
A[i]--;
A[j]--;
}
if (!A[i])
{
i=urm(ma);
ma=i;
if (!i && urm(j))
{
while (A[j]!=0)
{
printf("%c",j+'a'-1);
A[j]--;
}
return 0;
}
}
if (!A[j])
{
j=urm(ma);
ma=j;
if (!j && i)
{
while (A[i]!=0)
{
printf("%c",i+'a'-1);
A[i]--;
}
return 0;
}
}
}
return 0;
}