Pagini recente » Cod sursa (job #48257) | Cod sursa (job #2354685) | Cod sursa (job #219303) | Cod sursa (job #2307100) | Cod sursa (job #1125021)
#include <fstream>
#include <cstring>
using namespace std;
const int N=12;
char a[N][N];
int b[N], vv[N][N], n, nr, sol;
int verif()
{
int i, j;
memset(vv, 0, sizeof(vv));
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
{
if(a[i][j]) vv[b[i]][b[j]]=1;
}
}
for(i=1;i<=nr;++i)
{
for(j=1;j<=nr;++j)
{
if(i!=j&&!vv[i][j]) return 0;
}
}
return 1;
}
void bt(int k)
{
if(k==n+1)
{
sol+=verif();
return;
}
for(int i=1;i<=nr;++i)
{
b[k]=i;
bt(k+1);
}
b[k]=++nr;
bt(k+1);
--nr;
}
int main()
{
FILE *in = fopen("copii.in","r");
FILE *out = fopen ("copii.out","w");
int i, j;
fscanf(in,"%d\n",&n);
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j){
a[i][j]=fgetc(in);
a[i][j]-='0';
}
fscanf(in,"\n");
}
bt(1);
fprintf(out,"%d\n",sol-1);
fclose(in);
fclose(out);
return 0;
}