Bingo

#include #include int edge[205][205], vis[205], flag, n; bool dfs(int cur, int color) { for (int i = 0; i < n; i++) if (edge[cur][i] && vis[i] == vis[cur]) flag = 0; for (int i = 0; i < n

#include #include int node[55], edge[55][55] = {0}; int find_father(int x) { return x != node[x] ? node[x] = find_father(node[x]) : x; } int dfs(int cur) { for (int i = 0; i < 51; i++) if (ed

#include #include int node[26]; int find_father(int x) { return x != node[x] ? node[x] = find_father(node[x]) : x; } int main() { int t; scanf("%d", &t); while (t--) { int outdegree[26] =

#include int node[201], degree[201]; int find(int x) { if (x != node[x]) //假如此结点连接了其他结点, 就寻找它所连接的结点是否又连接了其他结点 return node[x] = find(node[x]); //此联通路上面的所有结点都指向同一个端点 return x; } int

#include #include using namespace std; int level, row, column; int dir[6][3] = {{1, 0, 0}, {-1, 0, 0}, {0, 1, 0}, {0, -1, 0}, {0, 0, 1}, {0, 0, -1}}; char dungeon[35][35][35]; struct Node { int x;

#include int x, y, max, dir[8][2] = {{2, 1}, {2, -1}, {-2, -1}, {-2, 1}, {-1, -2}, {-1, 2}, {1, -2}, {1, 2}}; void explore(int a, int b, int step) { if (a 7 || b 7 || step >= max) //如果越界则说明

#include char data[35][85]; int row, column, dir[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; void explor(int x, int y) { if (data[x][y] == '#' || data[x][y] == 'X' || x < 0 || x == row || y < 0 ||

#include char data[55][55]; int row, column, count = 0, dir[8][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; bool find_dot(int x, int y) { if (data[x][y] != 'X' || x < 0 || x == row || y < 0 || y == col

#include char data[150][150]; int row, column; bool find(int x, int y) { if (data[x][y] == '*' || x < 0 || x == row || y < 0 || y == column) //遇到边界、已来过、非油田就结束 return false; data[x][y] = '*'; //

#include #include char data[80][80], maze[240][240]; int row, column, flag, step, dir[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}}; bool find_cycle(int x, int y) { if (x < 0 || x == 3 * row || y < 0

#include int main() { int n, m; while (scanf("%d%d", &n, &m), n) { int edge[105][105] = {0}, indegree[105] = {0}; for (int i = 0; i < m; i++) { int a, b; scanf("%d%d", &a, &b); edge[a