Pagini recente » Istoria paginii runda/rezolvarijudeteanaliceu/clasament | Istoria paginii runda/test_tehnic/clasament | Cod sursa (job #838028) | Cod sursa (job #1090548) | Cod sursa (job #170477)
Cod sursa(job #170477)
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int n,i,k,j,y;
char c[36][17];
int sort_function( const void *a, const void *b)
{ return (strcmp((char*)b,(char*)a));}
int main()
{ freopen("restante.in","r",stdin);
freopen("restante.out","w",stdout);
scanf("%d",&n);
for(i=0;i<n;i++)
{ scanf("%s",&c[i]);
qsort((void *)c[i], strlen(c[i]), sizeof(c[0][0]), sort_function);
}
qsort((void*)c,n+1,sizeof(c[0]),sort_function);i=0;y=n;
do
{ k=1;
while(strcmp(c[i],c[i+1]==0)) {k++;i++;}
if(k>1) y-=k;
else i++;
}
while(i<n);
printf("%d",y);
return 0;
}