Pagini recente » Cod sursa (job #2448254) | Cod sursa (job #218889) | Cod sursa (job #3179444) | Cod sursa (job #1765816) | Cod sursa (job #1048216)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("litere.in");
ofstream g("litere.out");
int n, i, j, nr, ap[27], nrf;
char lit[10001];
int main()
{
f>>n;
for (i=1; i<=n; i++)
{
f>>lit[i];
ap[lit[i]-97+1]++;
}
for (i=1; i<=n; i++)
{
j=1;
while (ap[lit[i]-97+1]>0)
{
if (lit[j]>lit[i])
{
nr++;
}
if (lit[i]==lit[j])
{
ap[lit[i]-97+1]--;
nrf+=nr;
}
j++;
}
nr=0;
}
g<<nrf;
return 0;
}