Cod sursa(job #2014899)
| Utilizator | Data | 24 august 2017 16:37:03 | |
|---|---|---|---|
| Problema | Restante | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("restante.in");
ofstream out("restante.out");
int main()
{
int n; in>>n;
string s[36009];
for(int i=1; i<=n; i++)
{
in>>s[i];
sort(s[i].begin(), s[i].end());
}
sort(s+1,s+n+1);
int sol=0;
for(int i=1; i<=n; i++)
{
if( s[i-1] != s[i] && s[i+1] !=s [i] ) sol ++;
}
out<<sol;
return 0;
}
