Pagini recente » Cod sursa (job #1790179) | Cod sursa (job #3127844) | Cod sursa (job #293791) | Istoria paginii runda/practice-round-2015 | Cod sursa (job #1837540)
#include <fstream>
#include <cstring>
#define nmax 1000005
#define teta 26
using namespace std;
ifstream f("ordine.in");
ofstream g("ordine.out");
int n,v[teta];
char s[nmax],k[nmax];
int main()
{
int i,j;
f>>s;
n=strlen(s);
for (i=0;i<n;i++)
v[s[i]-'a']++;
j=0;
while (v[j]==0)
j++;
k[0]=j+'a';
v[j]--;
for (i=1;i<n;i++) {
j=0;
while (v[j]==0||j+'a'==k[i-1])
j++;
v[j]--;
k[i]=j+'a';
}
g<<k;
return 0;
}