Cod sursa(job #991976)
Utilizator | Data | 31 august 2013 22:32:13 | |
---|---|---|---|
Problema | Ordine | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<fstream>
using namespace std;
char j,c,cv=0,s[1000003];
int n,i,w,fr[256];
ifstream f("ordine.in"); ofstream g("ordine.out");
int main()
{ f>>s;
for(n=0;s[n];++n) fr[s[n]]++;
for(i=0;i<n;i++)
{ for(w=1,j='a';j<='z' && w;j++)
if(fr[j]==(n-i)/2+1) c=j, w=0;
for(j='a';j<='z' && w;j++)
if(fr[j] && j!=cv) c=j, w=0;
g<<c; fr[c]--; cv=c;
}
g<<"\n"; g.close(); return 0;
}