Pagini recente » Cod sursa (job #1688487) | Cod sursa (job #2720301) | Cod sursa (job #2299229) | Cod sursa (job #890235) | Cod sursa (job #159571)
Cod sursa(job #159571)
#include <cstdio>
#include <algorithm>
#define Nmax 36003
#include <string.h>
FILE *fin=freopen("restante.in","r",stdin),
*fout=freopen("restante.out","w",stdout);
using namespace std;
char A[Nmax][20];
unsigned int viz[Nmax];
int comp(int a, int b) {
return strcmp( A[a], A[b] ); // compari liniile a si b din matrice
}
int n;
void citire()
{
scanf("%d",&n);
fgetc(fin);
for(int i=0; i<n; i++)
scanf(" %s",A[i]);
}
void dica()
{
int nr = n;
for(int i=0; i<n-1; i++)
for(int j=i+1; j<n; j++)
if(viz[i] == 0)
if(strcmp(A[i],A[j]) == 0)
viz[i] = viz[j] = 1,nr-=2;
printf("%d\n",nr);
}
void solve()
{
for(int i=0; i<n; i++)
sort(A[i],A[i] + strlen(A[i]));
dica();
}
int main()
{
citire();
solve();
return 0;
}