-
Notifications
You must be signed in to change notification settings - Fork 47
/
Copy path1128.c
77 lines (54 loc) · 1.14 KB
/
1128.c
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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
/*
@autor: Malbolge;
@data: 25/08/2019;
@nome: Ir e Vir;
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define true 1
#define false 0
#define MAXSIZE 2010
char vis[MAXSIZE];
char g[MAXSIZE][MAXSIZE];
int n;
void dfs(int);
int main(int argc, char **argv)
{
int m, u, v, p, i, j;
while (scanf("%d %d", &n, &m), m && n)
{
memset(g, 0, sizeof(g));
for (i = 0; i < m; ++i)
{
scanf("%d %d %d", &u, &v, &p);
if (p == 1)
g[u][v] = true;
else
g[u][v] = g[v][u] = true;
}
_Bool flag = false;
for (i = 1; i <= n; ++i)
{
memset(vis, 0, sizeof(vis));
dfs(i);
flag = false;
for (j = 1; j < n && !flag; ++j)
if (!vis[j])
flag = true;
if (flag)
break;
}
printf("%d\n", flag ? 0 : 1);
}
return 0;
}
void dfs(int u)
{
int i;
vis[u] = true;
for (i = 1; i <= n; ++i)
if (g[u][i])
if (!vis[i])
dfs(i);
}