Pagini recente » Cod sursa (job #3221701) | Cod sursa (job #592194) | Cod sursa (job #917988) | Cod sursa (job #149457) | Cod sursa (job #2540456)
#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
vector<string>v;
string s;
int main()
{
ifstream cin("restante.in");
ofstream cout("restante.out");
int n;
cin>>n;
for(int i=1; i<=n; i++)
{
cin>>s;
sort(s.begin(),s.end());
v.push_back(s);
}
if(n==1)
cout<<1;
if(n==2)
cout<<1+(v[0]!=v[1]);
if(n>=3)
{
int nr=0;
sort(v.begin(),v.end());
for(int i=1; i<v.size()-1; i++)
if(v[i]!=v[i-1] and v[i]!=v[i+1])
nr++;
if(v[0]!=v[1])
nr++;
if(v[v.size()-2]!=v[v.size()-1])
nr++;
cout<<nr;
}
return 0;
}