Cod sursa(job #2481354)

Utilizator lucianistratiIstrati Lucian lucianistrati Data 26 octombrie 2019 19:51:36
Problema Copii Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.63 kb
#include <iostream>
#include <string.h>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
int v[15],n,rez=-1;
bool a[15][15],nr[15][15];
vector <int> G[20];
void afisare()
{
    int i,j;
    for(i=1;i<=13;i++)
    {for(j=1;j<=13;j++)

        cout<<a[i][j]<<" ";
    cout<<"\n";
    }
}
bool verificare(int m)
{
    int i,j;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
    {
        if(a[i][j]==true)
        {
            nr[v[i]][v[j]]=true;
        }
    }
    for(i=1;i<=m;i++)
        for(j=i+1;j<=m;j++)
    {
        if(nr[i][j]==false)
        {
            return false;
        }
    }
    return true;
}
void Bkt(int k,int m)
{
    int i;
    if(k==n+1)
    {
        //cout<<"da";
        int t;
        t=verificare(m);
        rez+=t;
        return;
    }
    else
    {
        for(i=1;i<=m;i++)
        {
            v[k]=i;
            Bkt(k+1,m);
        }
        v[k]=m+1;
        Bkt(k+1,m+1);
    }
}
int main()
{
    ifstream fin("copii.in");
    ofstream fout("copii.out");
    //afisare();

    int i,j;
    char s[15];
    fin>>n;
    for(i=1;i<=n;i++)
    {
        v[i]=0;
    }
    fin.get();
    for(i=1;i<=n;i++)
    {
       fin.get(s,12);
       fin.get();
       //cout<<s<<"\n";
       for(j=0;j<strlen(s);j++)
       {
           if(s[j]=='1')
                a[i][j+1]=true;
            else
            {
                a[i][j+1]=false;
                G[i].push_back(j+1);
            }
       }
    }
    Bkt(1,0);
    fout<<rez;
    //P
    //artitii(n,)
    fin.close();
    fout.close();
    return 0;
}