Pagini recente » Cod sursa (job #191463) | Cod sursa (job #3186672) | Cod sursa (job #368505) | Cod sursa (job #3273726) | Cod sursa (job #1216715)
#include <fstream>
#include <cstring>
using namespace std;
const int N=12;
ifstream fin("copii.in");
ofstream fout("copii.out");
char a[N][N];
int b[N], c[N][N];
int n, nr, sol;
int verific()
{
int i, j;
memset(c, 0, sizeof(c));
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
{
if(a[i][j]) c[b[i]][b[j]]=1;
}
}
for(i=1;i<=nr;++i)
{
for(j=1;j<=nr;++j)
{
if(i!=j && !c[i][j]) return 0;
}
}
return 1;
}
void back(int k)
{
if(k==n+1)
{
sol+=verific();
return;
}
for(int i=1;i<=nr;++i)
{
b[k]=i;
back(k+1);
}
b[k]=++nr;
back(k+1);
--nr;
}
int main()
{
int i, j;
fin>>n;
for(i=1;i<=n;++i)
{
fin>>(a[i]+1);
for(j=1;j<=n;++j) a[i][j]-='0';
}
back(1);
fout<<sol-1;
return 0;
}