Pagini recente » Cod sursa (job #242261) | Cod sursa (job #2390540) | Cod sursa (job #3124148) | Cod sursa (job #18874) | Cod sursa (job #1606196)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("ordine.in");
ofstream fout("ordine.out");
int n,fr[1005];
char s[1000155];
void Solve(int last)
{
int i;
bool ok = false;
for(i = 0; i < 26; i++)
{
if(i!=last && fr[i] > n/2)
{
fr[i]--;
fout<<(char)(i+'a');
ok = true;
last = i;
break;
}
}
if(!ok)
{
for(i = 0 ; i < 26; i++)
{
if(i!=last && fr[i]>0)
{
fout<<(char)(i+'a');
fr[i]--;
last = i;
break;
}
}
}
n--;
//if(n>0) Solve(last);
}
int main()
{
int i,j;
fin>>(s+1);
n = strlen(s+1);
for(i = 1; i <= n; i++)
fr[s[i]-'a']++;
Solve(-1);
fout.close();
return 0;
}