Pagini recente » Cod sursa (job #2745251) | Cod sursa (job #1973202) | Cod sursa (job #2699022) | Cod sursa (job #2131810) | Cod sursa (job #306478)
Cod sursa(job #306478)
#include<iostream>
#include<fstream>
char aux;
using namespace std;
int n;
long ss;
char a[10001],sir[10001];
int b[500];
void contor()
{
int i,j,k,nn;
k=0;
for(i=0;i<n;i++)
{
b[int(a[i])]++;
if(b[int(a[i])]==1)
sir[k++]=a[i];
}
nn=k;
k=n-1;
for(k=n-1;k>=0;k--)
for(j=nn-1;j>=0;j--)
{
if(sir[j]==a[k])
for(i=k-1;i>=0;i--)
if(sir[j]<a[i])
ss++;
}
}
int main()
{
ifstream f ("litere.in");
ofstream o ("litere.out");
f>>n;
f.get();
f.get(a,n+1);
contor();
int i;
//for(i=0;i<n;i++)
// cout<<a[i]<<" ";
o<<ss;
return 0;}