Pagini recente » Cod sursa (job #1871151) | Cod sursa (job #996696) | Cod sursa (job #928461) | Cod sursa (job #346616) | Cod sursa (job #3258858)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("restante.in");
ofstream fout("restante.out");
int main()
{
int n, cnt = 0;
bool original = true;
fin >> n;
char cuv[36001][17];
for (int i = 0; i < n; i++)
{
fin >> cuv[i];
sort(cuv[i], cuv[i] + strlen(cuv[i]) + 1);
}
for (int i = 0; i < n; i++)
{
original = true;
for (int j = i + 1; j < n; j++)
{
if (strcmp(cuv[i], cuv[j]) == 0)
{
original = false;
break;
}
}
if (original)
{
cnt++;
}
}
fout << cnt;
return 0;
}