Pagini recente » Cod sursa (job #2339393) | Cod sursa (job #1012459) | Cod sursa (job #1905570) | Cod sursa (job #107723) | Cod sursa (job #485663)
Cod sursa(job #485663)
#include<cstdio>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
const int N=36005;
string s;
vector <string> a;
int n,nr;
void rez()
{
nr=0;
for (int i=1;i<n-1;++i)
if (a[i]!=a[i-1] && a[i]!=a[i+1])
++nr;
if (a[0]!=a[1])
++nr;
if (a[n-2]!=a[n-1])
++nr;
printf("%d\n",nr);
}
void citire()
{
scanf("%d",&n);
for (int i=1;i<=n;++i)
{
scanf("%s",&s);
sort(s.begin(),s.end());
a.push_back(s);
}
sort(a.begin(),a.end());
}
int main()
{
freopen("restante.in","r",stdin);
freopen("restante.out","w",stdout);
citire();
rez();
return 0;
}