Pagini recente » Cod sursa (job #1075754) | Cod sursa (job #1125036) | Cod sursa (job #1084576) | Cod sursa (job #2712029) | Cod sursa (job #3261460)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream in("restante.in");
ofstream out("restante.out");
vector<string> s;
int main()
{
int n;
in>>n;
string v;
for(int i=0; i<n; ++i)
{
in>>v;
sort(v.begin(), v.end());
//cout<<v<<'\n';
s.push_back(v);
}
sort(s.begin(), s.end());
int cnt=0; //cate cuvinte sunt la fel
for(int i=0; i<s.size(); ++i)
{
if(s[i]==s[i+1])
++cnt;
else
{
if(cnt>0)
n=n-(cnt+1);
cnt=0;
}
//cout<<s[i]<<" si cnt "<<cnt<<'\n';
}
out<<n;
return 0;
}