Pagini recente » Cod sursa (job #2022691) | Cod sursa (job #660864) | Cod sursa (job #1468052) | Cod sursa (job #1274789) | Cod sursa (job #2832968)
#include <iostream>
#include <cstring>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("restante.in");
ofstream fout("restante.out");
const int NMAX=36000;
string s[NMAX+5];
int main()
{
int n,i,kon=0;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>s[i];
sort(s[i].begin(),s[i].end());
}
sort(s+1,s+n+1);
for(i=1;i<=n;i++)
if(s[i-1]!=s[i] && s[i]!=s[i+1])
kon++;
fout<<kon;
return 0;
}