Cod sursa(job #115153)
| Utilizator | Data | 16 decembrie 2007 11:11:41 | |
|---|---|---|---|
| Problema | Litere | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | preONI 2008, Runda 2, Clasa a 9-a | Marime | 0.39 kb |
#include<iostream.h>
#include<fstream.h>
ifstream f("litere.in");
ofstream g("litere.out");
int main()
{
int n;
char c[10000];
f>>n;
for(int i=1;i<=n;i++)
f>>c[i];
f.close();
int flag=1;
long contor=0;
while(flag)
{flag=0;
for(int i=1;i<=n-1;i++)
{
if (c[i+1]<c[i])
{int aux=c[i];c[i]=c[i+1];c[i+1]=aux;flag=1;contor++;break;}
}
}
g<<contor;
f.close();
g.close();
return 0;
}