Pagini recente » Cod sursa (job #658770) | Cod sursa (job #2193578) | Cod sursa (job #1179610) | Cod sursa (job #2194572) | Cod sursa (job #2266375)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("copii.in");
ofstream out("copii.out");
int n, sol[11], ans;
char a[12][12];
bool mat[11][11];
void prelucrare(int m)
{
if (m == 1)
{
return;
}
for (int i = 1; i <= m; i++)
{
for (int j = 1; j <= m; j++)
{
mat[i][j] = false;
}
}
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
{
if(a[i][j] == '1')
mat[sol[i]][sol[j]] = true;
}
for (int i = 1; i <= m; i++)
{
for (int j = 1; j <= m; j++)
{
if (i != j && !mat[i][j])
{
return;
}
}
}
ans++;
}
void bkt(int p, int m)
{
if(p-1 == n)
{
prelucrare(m);
return;
}
for(int i=1; i<=m; i++)
{
sol[p] = i;
bkt(p+1, m);
}
sol[p] = m+1;
bkt(p+1, m+1);
}
int main()
{
in>>n;
for(int i=1; i<=n; i++)
in>>(1 + a[i]);
in.close();
bkt(1, 0);
out << ans;
out.close();
return 0;
}