Cod sursa(job #1535962)
Utilizator | Data | 25 noiembrie 2015 14:47:51 | |
---|---|---|---|
Problema | Litere | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
#include <algorithm>
#include <cmath>
using namespace std;
ifstream f("litere.in");
ofstream g("litere.out");
int s,j;bool sortat;
int main()
{int n,i;char a[10001],x;
f>>n;
for(i=1;i<=n;i++)
{
f>>a[i];
}
while(!sortat)
{
sortat=1;
for(i=1;i<n;i++)
{
if(a[i]>a[i+1])
{
swap(a[i],a[i+1]);
s++;sortat=0;
}
}
}
//g<<a[n];
g<<s;
f.close();
g.close();
return 0;
}