Pagini recente » Cod sursa (job #3250577) | Cod sursa (job #2724215) | Cod sursa (job #2229595) | Cod sursa (job #1615388) | Cod sursa (job #3152919)
#include <fstream>
using namespace std;
ifstream fin("copii.in");
ofstream fout("copii.out");
int n;
char ch, a[20][20];
int nr, sol[25];
bool x[25][25];
void solutii(int k)
{
int i,j;
for (int i=1;i<=k;i++)
for (int j=1;j<=k;j++)x[i][j]=false;
for(int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (a[i][j]=='1')x[sol[i]][sol[j]]=true;
for (int i=1;i<=k;i++)
for (int j=1;j<=k;j++)
if (i!=j && x[i][j]==false)
return;
nr++;
}
void backtr(int p, int q)
{
if (p==n+1)
{
bool ok=true;
for (int i=1;i<=q;i++)
for (int j=1;j<=q;j++)x[i][j]=false;
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (a[i][j] == '1')
x[sol[i]][sol[j]] = true;
for (int i=1;i<=q;i++)
for (int j=1;j<=q;j++)
if (i!=j && x[i][j] == false) {ok = false;
break; }
if (ok==true) nr++;
return;
}
for (int i=1;i<=q;i++) { sol[p] = i;
backtr(p + 1, q);}
sol[p] = q + 1;
backtr(p + 1, q + 1);
}
int main()
{
fin>> n;
fin.get();
for (int i=1; i<=n; i++)
fin.getline(1 + a[i], 20);
backtr(1, 0);
fout<<nr- 1;
return 0;
}