Pagini recente » Cod sursa (job #2826200) | Cod sursa (job #2742752) | Cod sursa (job #451307) | Cod sursa (job #1886563) | Cod sursa (job #243891)
Cod sursa(job #243891)
#include <iostream>
#include <fstream>
#include <map>
#include <algorithm>
using namespace std;
const char iname[] = "restante.in";
const char oname[] = "restante.out";
map <string, int> M;
int main(void)
{
ifstream in(iname);
ofstream out(oname);
int words;
string word;
in >> words;
for (int i = 0; i < words; ++ i) {
in >> word;
sort(word.begin(), word.end());
M[word] ++;
}
int res = 0;
map <string, int>::iterator it;
for (it = M.begin(); it != M.end(); ++ it) {
if ((*it).second == 1)
res ++;
}
out << res;
in.close(), out.close();
return 0;
}