Pagini recente » Cod sursa (job #3260901) | Cod sursa (job #3167353) | Cod sursa (job #2778776) | Cod sursa (job #1890725) | Cod sursa (job #1221146)
#include<fstream>
#include<string>
#include<algorithm>
using namespace std;
ifstream cin("restante.in");
ofstream cout("restante.out");
int n,i,sol;
string s,cuv[36010];
int main()
{
cin>>n;
for (i=1;i<=n;i++)
{
cin>>s;
sort(s.begin(),s.end());
cuv[i]=s;
}
sort(cuv+1,cuv+n+1);
cuv[0]=cuv[n+1]="!";
for (i=1;i<=n;i++)
if (cuv[i]!=cuv[i-1] && cuv[i]!=cuv[i+1])
sol++;
cout<<sol;
return 0;
}