Pagini recente » Cod sursa (job #1204862) | Cod sursa (job #32173) | Cod sursa (job #924212) | Cod sursa (job #927490) | Cod sursa (job #1105577)
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string>
#include<iostream>
using namespace std;
int main()
{
int N, ok, nr = 0;
int counter = 1;
vector<string> cuvinte;
string cuvant;
freopen("restante.in", "r", stdin);
freopen("restante.out", "w", stdout);
scanf("%d", &N);
for(int i = 0; i < N; ++i)
{
cin >> cuvant;
cuvinte.push_back(cuvant);
}
for(int i = 0; i < N; ++i)
sort(cuvinte[i].begin(), cuvinte[i].end());
sort(cuvinte.begin(), cuvinte.end());
for(int i = 1; i < N; ++i)
{
if((cuvinte[i] == cuvinte[i-1]))
{
counter++;
}
else
{
if(counter == 1)
nr++;
counter = 1;
}
}
if(counter == 1)
nr++;
printf("%d\n", nr);
return 0;
}