Pagini recente » Cod sursa (job #2899006) | Cod sursa (job #1863969) | Cod sursa (job #2362566) | Cod sursa (job #2769085) | Cod sursa (job #2014899)
#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;
}