Pagini recente » Cod sursa (job #2182953) | Cod sursa (job #3223544) | Cod sursa (job #2335833) | Cod sursa (job #315876) | Cod sursa (job #862549)
Cod sursa(job #862549)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("copii.in");
ofstream out ("copii.out");
int n,m,sol[101],nr[101],t;
char ma[101][101];
int valid()
{
int ok=1,i,j,b[101][101]={0};
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(ma[i][j]=='1') b[sol[i]][sol[j]]=1;
for(i=1;i<=m;i++)
for(j=1;j<=m;j++)
if(b[i][j]!=1)
{
ok=0;
break;
}
if(ok==1)t++;
}
void bkt(int p)
{
int i;
if(p==n+1)
{
valid();
return;
}
else
{
for(i=1;i<=m;i++)
{
sol[p]=i;
bkt(p+1);
}
sol[p] = ++m;
bkt(p+1);
m--;
}
}
int main()
{
int i,j,a;
in>>n>>ws;
for(i=1;i<=n;i++)
{
in>>ma[i];
}
bkt(1);
out<<t;
return 0;
}