-
Notifications
You must be signed in to change notification settings - Fork 59
/
Copy pathcopii.cpp
56 lines (54 loc) · 1022 Bytes
/
copii.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
# include <fstream>
# include <cstring>
using namespace std;
ifstream f("copii.in");
ofstream g("copii.out");
int i,j,n,nr,VV;
int ver[11][11],drum[100][100],a[100];
char s[100];
int verifica()
{
int ok=1;
for (i=1; i<=n; ++i) //init
for (j=1; j<=n; ++j)
ver[i][j]=0;
for (i=1; i<=n; ++i) //vad ce grupe se invecineaza
for (j=1; j<=n; ++j)
if (drum[i][j]) ver[a[i]][a[j]]=1;
for (i=1; i<=nr; ++i)//verific
for (j=1; j<=nr; ++j)
if (i!=j && !ver[i][j]) return 0;
return 1;
}
void back (int k)
{
int i;
if (k==n+1)
{
VV+=verifica();
}
else
{
for (i=1; i<=nr; ++i)
{
a[k]=i;
back(k+1);
}
a[k]=++nr;
back(k+1);
--nr;
}
}
int main ()
{
f>>n; f.get();
for (i=1; i<=n; ++i)
{
f.getline(s+1,100);
for (j=1; j<=n; ++j)
if (s[j]=='1') drum[i][j]=1;
}
back(1);
g<<VV-1<<"\n";
return 0;
}