Pagini recente » Cod sursa (job #492869) | Cod sursa (job #1830466) | Cod sursa (job #764427) | Cod sursa (job #2018026) | Cod sursa (job #125936)
Cod sursa(job #125936)
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
#define MAXL 32
char tmp[MAXL];
int N;
vector< string > x;
int main()
{
freopen("restante.in", "rt", stdin);
freopen("restante.out", "wt", stdout);
scanf("%d", &N);
for (int i = 0; i < N; i++)
{
string cur, Min;
scanf(" %s", tmp);
cur = tmp;
sort( cur.begin(), cur.end() );
x.push_back( cur );
}
sort( x.begin(), x.end() );
int NR = 0;
for (size_t k = 0; k < x.size(); k++)
{
string prv = "", nxt = "";
if (k > 0) prv = x[k - 1];
if (k + 1 < x.size()) nxt = x[k + 1];
if (x[k] != prv && x[k] != nxt)
NR++;
}
printf("%d\n", NR);
return 0;
}