Pagini recente » Cod sursa (job #2063953) | Cod sursa (job #3136467) | Cod sursa (job #999999) | Cod sursa (job #790634) | Cod sursa (job #226535)
Cod sursa(job #226535)
#include<stdio.h>
#include<string.h>
int n,vf1[17],vf2[17];
int cuvs[36000][18];
int convert(int a,int b)
{
if(cuvs[a][0]!=cuvs[b][0])
return 0;
else
{
for(int i=1;i<=cuvs[a][9];++i)
{vf1[cuvs[a][i]]++;vf2[cuvs[b][i]]++;}
return 1;
}
}
int compare()
{
for(int i=0;i<17;++i)
{
if(vf1[i]!=vf2[i])
return 0;
vf1[i]=vf2[i]=0;
}
return 1;
}
int main()
{
int ncuv;
char cuv[18];
freopen("restante.in","r",stdin);
freopen("restante.out","w",stdout);
scanf("%d",&n);
int i;
for(i=0;i<n;++i)
{
gets(cuv);
ncuv=strlen(cuv);
cuvs[i][0]=ncuv;
for(int j=1;j<=ncuv;++j)
cuvs[i][j]=cuv[i]-97;
}
int nr=0;
int nrt=0;
int last=0;
for(i=0;i<n-1;++i)
{
nr=0;
for(int j=i+1;j<n;++j)
{
if(convert(i,j))
if(compare())
{nr=1;if(j==(n-1))last=1;break;}
}
if(!nr)
++nrt;
}
if(last)
nrt--;
printf("%d",nrt);
return 0;
}