Cod sursa(job #2172846)
Utilizator | Data | 15 martie 2018 18:20:16 | |
---|---|---|---|
Problema | Litere | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.81 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("litere.in");
ofstream g("litere.out");
int n,nr=0,k;
char a[10001],alfabet[27]="abcdefghijklmnopqrstuvwxyz",aux;
int main()
{
f>>n;
for (int i=0;i<n;i++)
f>>a[i];
int j=0;
for (int i=0;i<26;i++)
{
k=j;
while (k<n)
{
if (a[k]==alfabet[i])
{
if (k==j) j++;
else
{
nr=nr+(k-j);
for (int l=k;l>j;l--)
{
aux=a[l];
a[l]=a[l-1];
a[l-1]=aux;
}
j++;
}
}
k++;
}
}
g<<nr;
}