Pagini recente » Cod sursa (job #844079) | Cod sursa (job #2414580) | Cod sursa (job #2043353) | Cod sursa (job #2595448) | Cod sursa (job #2474795)
#include <fstream>
#include <cstring>
using namespace std;
const int maxN=12;
int n,sol;
int stk[maxN];
char mat[maxN][maxN];
bool ok[maxN][maxN];
ifstream f("copii.in");
ofstream g("copii.out");
bool check(int cntTeams){
if(cntTeams==0 || cntTeams==1){
return false;
}
memset(ok,false,sizeof(ok));
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(mat[i][j]=='1'){
ok[stk[i]][stk[j]]=true;
}
}
}
for(int i=1;i<=cntTeams;i++){
for(int j=1;j<=cntTeams;j++){
if(i!=j && ok[i][j]==false){
return false;
}
}
}
return true;
}
void bkt(int k,int cntTeams){
if(k==n+1){
if(check(cntTeams)){
sol++;
}
return;
}
for(int i=1;i<=cntTeams;i++){
stk[k]=i;
bkt(k+1,cntTeams);
}
stk[k]=cntTeams+1;
bkt(k+1,cntTeams+1);
}
int main(){
f>>n;
for(int i=1;i<=n;i++){
f>>(mat[i]+1);
}
bkt(1,0);
g<<sol;
return 0;
}