Pagini recente » Cod sursa (job #2784152) | Cod sursa (job #2443726) | Cod sursa (job #2520293) | Cod sursa (job #2585282) | Cod sursa (job #1603577)
#include <fstream>
#include <string>
#include <algorithm>
std::ifstream fin("restante.in");
std::ofstream fout("restante.out");
std::string Words[36001];
int n, r;
int main()
{
fin >> n;
for (int i = 1;i <= n;++i)
{
fin >> Words[i];
std::sort(Words[i].begin(), Words[i].end());
}
fin.close();
std::sort(Words+1, Words+n+1);
for (int i = 1; i <= n; ++i)
if (Words[i - 1] != Words[i] && Words[i] != Words[i + 1])
++r;
fout << r;
fout.close();
return 0;
}