Pagini recente » Cod sursa (job #1873955) | Cod sursa (job #2819335) | Cod sursa (job #2416216) | Cod sursa (job #197236) | Cod sursa (job #1357674)
#include<cstdio>
#include<cstring>
int n,i,j,nr,s,v[20][20],y[20][20],x[20];
char ss[20][20];
FILE *f,*g;
int verif(){
memset(y,0,sizeof(y));
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if( ss[ i ][ j ]=='1' && x[i] != x[j] ) {
y[ x[i] ] [ x[j] ]=1;
}
}
}
for(int i=1;i<=nr;i++){
for(int j=1;j<=nr;j++){
if(i!=j && !y[i][j])
return 0;
}
}
return 1;
}
void back(int k){
if(k==n+1){
s+=verif();
return;
}
for(int i=1;i<=nr;i++){
x[k]=i;
back(k+1);
}
x[k]=++nr;
back(k+1);
nr--;
}
int main(){
f=fopen("copii.in","r");
g=fopen("copii.out","w");
fscanf(f,"%d",&n);
for(i=1;i<=n;i++){
fscanf(f,"%s",ss[i]+1);
}
back(1);
fprintf(g,"%d",s-1);
fclose(f);
fclose(g);
return 0;
}