Pagini recente » Cod sursa (job #237833) | Cod sursa (job #135729) | Cod sursa (job #512415) | Cod sursa (job #1938827) | Cod sursa (job #319336)
Cod sursa(job #319336)
<html><head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8"></head><body><textarea style="width: 99%; height: 99%;">#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct lm
{ int nr;
char s[20];
} b[36002];
int fcomp(lm a,lm b)
{ int x=strlen(a.s),y=strlen(b.s),z;
if(x!=y) return x<y;
z=strcmp(a.s,b.s);
if(z<=0) return 1;
return 0;
}
int i,j,n,nr,k,a[36002];
int main()
{ freopen("restante.in","r",stdin);
freopen("restante.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++) { scanf("%s",&b[i].s);
k=strlen( b[i].s);
sort(b[i].s,b[i].s+k);
}
sort(b+1,b+n+1,fcomp);
for(i=2;i<=n;i++) if(strcmp(b[i].s,b[i-1].s)==0) a[i]=1,a[i-1]=1;;
k=0;
for(i=1;i<=n;i++) if(!a[i])k++;
printf("%d\n",k);
fclose(stdin);
fclose(stdout);
return 0;
}
</textarea></body></html>