Pagini recente » Cod sursa (job #1374183) | Cod sursa (job #179247) | Cod sursa (job #1840189) | Cod sursa (job #351840) | Cod sursa (job #167779)
Cod sursa(job #167779)
#include <stdio.h>
int n;
int i, j, k;
int s[30];
char c;
int last;
int main()
{
freopen("ordine.in", "r", stdin);
freopen("ordine.out", "w", stdout);
scanf("%c", &c);
while ( 'a' <= c && c <= 'z' )
{
s[(int)(c-'a'+1)]++;
n++;
scanf("%c", &c);
}
for ( i = 1; i <= n; i++ )
{
int ok = 0;
for ( j = 1; j <= 26; j++ )
if ( s[j] == (n-i+1)/2 + 1 )
{
printf("%c", (char)(j-1+'a'));
last = j;
s[j]--;
ok = 1;
break;
}
if ( !ok )
for ( j = 1; j <= 26; j++ )
if ( s[j] > 0 && j != last )
{
printf("%c", (char)(j-1+'a'));
last = j;
s[j]--;
break;
}
}
printf("\n");
return 0;
}