Cod sursa(job #115212)
Utilizator | Data | 16 decembrie 2007 11:40:12 | |
---|---|---|---|
Problema | Litere | Scor | 40 |
Compilator | cpp | Status | done |
Runda | preONI 2008, Runda 2, Clasa a 9-a | Marime | 0.34 kb |
#include<fstream.h>
#include<string.h>
ifstream f("litere.in");
ofstream g("litere.out");
char a[10001];
int n,ga=1;
long s;
int main()
{
f>>n;
for(int k=0;k<=n-1;k++)
f>>a[k];
for(int i=0;i<=n-1&&ga;i++)
{ga=0;
for(int j=0;j<n-1-i;j++)
if(a[j]>a[j+1])
{char y=a[j];a[j]=a[j+1];a[j+1]=y;s++;ga=1;}
}
g<<s;
return 0;
}