Cod sursa(job #2389945)
| Utilizator | Data | 27 martie 2019 17:21:44 | |
|---|---|---|---|
| Problema | Litere | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.32 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("litere.in");
ofstream fout("litere.out");
int n;
long long inversiuni;
string str;
int main()
{
fin>>n;
fin.get();
fin>>str;
for (int i=0;i<n;i++)
for (int j=i+1;j<n;j++)
if (str[i]>str[j]) inversiuni++;
fout<<inversiuni<<'\n';
return 0;
}
