Pagini recente » Cod sursa (job #3228222) | Rating UAIC-Florea-Pojoga-Oniciuc (UAIC_Florea_Pojoga_Oniciuc) | Cod sursa (job #3262397) | Cod sursa (job #1136573) | Cod sursa (job #110230)
Cod sursa(job #110230)
#include<stdio.h>
#include<string.h>
char s[100001];
int i,nr,sortat,aux,max,j,ci,sol[100001],v[100001];
long f[40];
int main()
{
freopen("ordine.in","r",stdin);
freopen("ordine.out","w",stdout);
while(scanf("%c",v[i++])!=' ');
nr=i-1;
for(i=0;i<nr;i++)
{
v[i+1]=s[i]-96;
f[v[i+1]]++;
if(v[i+1]>max) max=v[i+1];
}
j=1;
for(i=1;i<=max;i++)
{
if(f[i] && sol[i]==0)
sol[i]=i;
else
if(sol[i])
{
while(sol[j])
j++;
sol[j]=i;
}
ci=j;
while(f[i]>1)
{
sol[ci+2]=i;
f[i]--;
ci=ci+2;
}
j++;
}
/*for(i=nr+5;i>=1;i--)
if(sol[i]==0 && sol[i+1])
ci=sol[i+1];
for(i=nr;i>=1;i--)
if(sol[i]!=ci && sol[i-1]!=ci)
{
nr++;
for(j=nr-1;j>=i;j--)
sol[j+1]=sol[j];
sol[i]=ci;
}*/
for(i=1;i<=1001;i++)
if(sol[i]==0)
continue;
else
printf("%c",sol[i]+96);
return 0;
}