Pagini recente » Cod sursa (job #186208) | Cod sursa (job #1992463) | Cod sursa (job #9454) | Cod sursa (job #2125996) | Cod sursa (job #1357666)
#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=0;j<n;j++){
if( ss[ x[i] ][ x[j] ]=='1' && x[i] != x[j+1] ){
y[ x[i] ][ x[j+1] ]=1;
}
}
}
for(int i=1;i<=nr;i++){
for(int j=1;j<=nr;j++){
if( y[ x[i] ][ x[j] ] == 0 && 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+1;
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]);
}
back(1);
fprintf(g,"%d",s-1);
fclose(f);
fclose(g);
return 0;
}