Pagini recente » preoji_bv_2017_1_10 | Cod sursa (job #925219) | Cod sursa (job #2615954) | Cod sursa (job #2579345) | Cod sursa (job #249203)
Cod sursa(job #249203)
#include<stdio.h>
#include<string.h>
#define fin "restante.in"
#define fout "restante.out"
#define L 36001
#define l 26
char v[L][l], aux[l], enter[l];
int n, i, j, count, sw;
void sort_cuv(char s[])
{
char aux;
for(int i = 0 ; i<strlen(s) - 1; i++)
for(int j = i+1; j<strlen(s); j++)
if( s[i] > s[j])
{
aux = s[i];
s[i] = s[j];
s[j] = aux;
}
}
int main(void)
{
freopen(fin, "r", stdin);
freopen(fout, "w", stdout);
scanf("%d", &n);
gets(enter);
for( i=1; i<=n; i++)
{
gets(v[i]);
sort_cuv(v[i]);
}
for( i=1; i<n; i++)
for( j=i+1;j<=n; j++)
if( strcmp(v[i], v[j]) > 0)
{
strcpy(aux, v[i]);
strcpy(v[i], v[j]);
strcpy(v[j], aux);
}
for(i=1; i<n; i++)
{
sw = 0;
for( j= i+1; j<=n; j++)
if( !strcmp( v[i], v[j]))
{
strcpy( v[j] ," ");
sw++;
}
if(sw)
strcpy(v[i], " ");
}
for( i = 1 ; i<=n ;i++)
if( !strcmp(v[i], " ") )
continue;
else
count++;
printf("%d\n", count);
fcloseall();
return 0;
}