Cod sursa(job #1391542)
| Utilizator | Data | 18 martie 2015 00:25:13 | |
|---|---|---|---|
| Problema | Restante | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <fstream>
#include <algorithm>
#define NM 36005
using namespace std;
ifstream fin("restante.in");
ofstream fout("restante.out");
int n,i,nr;
string s[NM];
int main()
{
fin >> n;
for (i=1; i<=n; i++)
{
fin >> s[i];
sort(s[i].begin(), s[i].end());
}
sort(s+1, s+n+1);
for (i=1; i<=n; i++)
if (s[i]!=s[i-1] && s[i]!=s[i+1])
nr++;
fout << nr;
fin.close();
fout.close();
return 0;
}
