Pagini recente » Cod sursa (job #2115622) | Cod sursa (job #550824) | Cod sursa (job #3127919) | Cod sursa (job #663171) | Cod sursa (job #459367)
Cod sursa(job #459367)
#include <cstdio>
#include <string.h>
int nrs,i,n,m;
char a[12][12];
int sol[20];
void prel(int m)
{
int i,j;
/*
for (i=1;i<=n;i++)
printf("%d ",sol[i]);
printf("\n");
*/
bool b[11][11]={false};
for(i=1;i<=n;++i)
for(j=1;j<=n;j++)
if(a[i][j]=='1')
b[sol[i]][sol[j]]=true;
for(i=1;i<=m;++i)
for(j=1;j<=m;++j)
if(i!=j && !b[i][j])
return;
++nrs;
}
void bkt(int k,int mm)
{
if (k==n+1)
{
prel(mm);
return;
}
for (i=1;i<=mm;++i)
{
sol[k]=i;
bkt(k+1,mm);
}
sol[k]=1+mm;
bkt(k+1,1+mm);
}
int main()
{
freopen("copii.in","r",stdin);
freopen("copii.out","w",stdout);
scanf("%d\n",&n);
for (int i=1;i<=n;i++)
{
gets(a[i]+1);
//puts(1+a[i]);
}
bkt(1,0);
printf("%d",nrs-1);
return 0;
}