Pagini recente » Cod sursa (job #2217048) | Cod sursa (job #2024301) | Cod sursa (job #222584) | Cod sursa (job #1618158) | Cod sursa (job #1657963)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <string>
using namespace std;
ifstream fin("restante.in");
ofstream fout("restante.out");
int n,k,i,j,sw;
//char s[36001][17];
string s[36001];
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>s[i];
std::sort(s[i].begin(),s[i].end());
//cout<<0<<s[i];
}
for(i=1;i<=n;i++)
{
sw=0;
for(j=1;j<=n&&!sw;j++)
if(s[i]==s[j]&&i!=j) sw=1;
if(!sw) k++;
}
fout<<k;
return 0;
}