Pagini recente » Cod sursa (job #2610413) | Cod sursa (job #1306152) | Cod sursa (job #926656) | Cod sursa (job #159296) | Cod sursa (job #2556242)
#include <fstream>
#include <algorithm>
#include <cstring>
using namespace std;
ifstream f ("restante.in");
ofstream g ("restante.out");
int n, i, j, lg, nr, rez;
char a[36000][20], s[20];
int main()
{
f >> n;
f.get();
for (i=1; i<=n; i++)
{
f.getline(s, sizeof(s));
lg = strlen(s), sort(s, s+lg);
nr ++, strcpy(a[nr], s);
}
for (i=1; i<=n; i++)
{
if (strcmp(a[i], a[i+1]) != 0)
rez ++;
j = i;
while (strcmp(a[j], a[j+1]) == 0 && j+1 <= n)
j ++;
i = j;
}
g << rez;
return 0;
}