Pagini recente » Cod sursa (job #2490998) | Cod sursa (job #457199) | Cod sursa (job #2768061) | Cod sursa (job #392155) | Cod sursa (job #1105565)
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string>
#include<iostream>
using namespace std;
int main()
{
int N, ok, nr = 0;
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());
if(cuvinte[0] != cuvinte[1])
nr++;
for(int i = 1; i < N-1; ++i)
{
if((cuvinte[i] != cuvinte[i-1]) && (cuvinte[i] != cuvinte[i+1]))
nr++;
}
if(cuvinte[N-1] != cuvinte[N-2])
nr++;
printf("%d\n", nr);
return 0;
}