Pagini recente » Cod sursa (job #32871) | Cod sursa (job #371069) | Cod sursa (job #2829966) | Cod sursa (job #2052018) | Cod sursa (job #3258964)
#include <fstream>
#include <algorithm>
#include <string>
#include <unordered_map>
std::ifstream fin("restante.in");
std::ofstream fout("restante.out");
std::unordered_map<std::string, int> mp;
int main()
{
int n;
int cate = 0;
fin >> n;
for (int i = 0; i < n; i++)
{
std::string word;
fin >> word;
std::sort(word.begin(), word.end());
auto total = mp[word]++;
}
for (std::pair<std::string, int> pair : mp)
{
if (pair.second == 1)
cate++;
}
fout << cate;
return 0;
}