Cod sursa(job #1743983)
| Utilizator | Data | 19 august 2016 01:37:31 | |
|---|---|---|---|
| Problema | Restante | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <fstream>
#include <algorithm>
#include <map>
#include <string>
using namespace std;
ifstream cin("restante.in");
ofstream cout("restante.out");
vector<string> v[36010];
map<string, int> Map;
string s;
int main() {
int n, answer = 0, nr = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s;
sort(s.begin(), s.end());
nr++;
v[nr].push_back(s);
Map[s]++;
}
for (int i = 1; i <= nr; i++)
if (Map[v[i][0]] == 1)
answer++;
cout << answer;
return 0;
}
