Pagini recente » Cod sursa (job #161519) | Borderou de evaluare (job #1597466) | Cod sursa (job #1442286) | Rezultatele filtrării | Cod sursa (job #2088866)
#include<bits/stdc++.h>
using namespace std;
ifstream f("copii.in");
ofstream g("copii.out");
int n;
char c[12][12];
long long sol;
int v[12];
bool mat[12][12];
inline bool verif(int hms)
{
bool ap[12]={0};
int nrt=0;
for(int i=1;i<=n;++i)
if(ap[v[i]]==0)
ap[v[i]]=1,++nrt;
if(nrt!=hms)
return 0;
memset(mat,0,sizeof(mat));
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
if(c[i][j]=='1')
mat[v[i]][v[j]]=1;
bool Hmmm=1; /// no problem without it
for(int i=1;i<=hms;++i){
int s=0;
for(int j=1;j<=hms;++j)
if(i!=j)
s+=mat[i][j];
if(s!=hms-1)
return 0;
}
return 1;
}
inline void bkt(int poz,int hms,int tmax)
{
if(poz>n)
sol+=verif(hms);
else
for(int i=1;i<=min(hms,tmax+1);++i)
v[poz]=i,bkt(poz+1,hms,max(tmax,i));
}
int main()
{
f>>n;
for(int i=1;i<=n;++i)
f>>(c[i]+1);
v[1]=1;
for(int i=2;i<=n;++i)
bkt(1,i,0);
g<<sol;
return 0;
}