Pagini recente » Cod sursa (job #33572) | Cod sursa (job #245773) | Cod sursa (job #313221) | Cod sursa (job #666018) | Cod sursa (job #2905411)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("litere.in");
ofstream fout("litere.out");
int n,s[10001];
long long sol;
char v[10001];
int main()
{
fin>>n;
fin>>v;
for(int i=0;i<=n-1;i++)
{
s[i]=v[i];
}
long long int nr=1;
while(nr!=0)
{
nr=0;
for(int i=1; i<=n-1; i++)
{
if(s[i-1]>s[i])
{
swap(s[i-1],s[i]);
sol++;
nr++;
}
}
}
fout<<sol;
return 0;
}