Pagini recente » Cod sursa (job #275044) | Cod sursa (job #2453658) | Cod sursa (job #1535541) | Cod sursa (job #1760025) | Cod sursa (job #1867134)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("restante.in");
ofstream fout ("restante.out");
string v[36002];
int main()
{
int n;
fin >> n;
for (int i=0;i<n;i++)
{
fin >> v[i];
sort (v[i].begin(), v[i].end());
}
sort (v,v+n);
int cnt;
if (v[0]!=v[1]) cnt=1;
else cnt=0;
for (int i=1;i<n;i++)
if (v[i]!=v[i-1] && v[i]!=v[i+1])cnt++;
fout << cnt << "\n";
}