Pagini recente » Cod sursa (job #2189907) | Cod sursa (job #360474) | Cod sursa (job #2620916) | Cod sursa (job #2284870) | Cod sursa (job #1882477)
#include <fstream>
#include <algorithm>
#include <string>
using namespace std;
ifstream fin("restante.in");
ofstream fout("restante.out");
const int NMAX = 36005;
string vec[NMAX];
int ans;
int main()
{
int n;
fin >> n;
for (int i = 0; i < n; ++ i)
{
string str;
fin >> str;
sort(str.begin(), str.end());
vec[i] = str;
}
fin.close();
if (vec[0] != vec[1])
++ ans;
for (int i = 1; i < n; ++ i)
if (vec[i] != vec[i + 1] && vec[i] != vec[i - 1])
++ ans;
fout << ans << "\n";
fout.close();
return 0;
}