Pagini recente » Cod sursa (job #223627) | Cod sursa (job #1556951) | Cod sursa (job #1244746) | Cod sursa (job #580849) | Cod sursa (job #2540944)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("restante.in");
ofstream cout("restante.out");
const int lim=36000+5;
string v[lim];
int f['z'-'a'+5];
int main()
{
string s;
int n,rasp=0;
cin>>n;
for(int i=1;i<=n;++i)
{
cin>>s;
for(int j=0;j<='z'-'a';++j)
f[j]=0;
for(int j=0;j<s.size();++j)
++f[s[j]-'a'];
for(int j=0;j<='z'-'a';++j)
for(int k=1;k<=f[j];++k)
v[i]+=(char)'a'+j;
}
sort(v+1,v+n+1);
for(int i=1;i<=n;++i)
if(v[i]!=v[i-1] and v[i]!=v[i+1])
++rasp;
cout<<rasp;
return 0;
}