Cod sursa(job #109658)
| Utilizator | Data | 25 noiembrie 2007 12:17:27 | |
|---|---|---|---|
| Problema | Ordine | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | preONI 2008, Runda 1, Clasele 5-8 | Marime | 0.54 kb |
#include <fstream.h>
#include <ctype.h>
long int nr[27],i,j,p2,p1,cp,ok;
char s[27],c;
ifstream f("ordine.in");
ofstream g("ordine.out");
int main()
{
i=-1;
for(c='a';c<='z';c++)
{
i++;
s[i]=c;
}
f>>c;
while(c!=cp)
{
for(i=0;i<=27;i++)
if(s[i]==c)
{
nr[i]++;
break;
}
cp=c;
f>>c;
}
f.close();
ok=0;
while(ok==0)
{
for(i=0;i<27;i++)
if(nr[i]!=0)
{
g<<s[i];
nr[i]--;
}
ok=1;
for(i=0;i<27;i++)
if(nr[i]!=0)
ok=0;
}
g.close();
return 0;
}