본문 바로가기

백준 알고리즘/BFS47

백준 2583번 C++ #include #include #include #include using namespace std; int M, N, K;int arr[100][100];int visited[100][100];int ans[100];int counts; typedef struct {int x;int y;}Move;Move m[4] = { {1,0},{-1,0},{0,1},{0,-1} }; void dfs(int a, int b) {visited[a][b] = 1;counts += 1; for (int i = 0; i = 0 && ma = 0 && mb < N) {if (arr[ma][mb] =.. 2019. 1. 8.
백준 11403번 C++ #include using namespace std; int n;int path[100][100]; void floyd() {for (int k = 0; k > n; for (int i = 0; i > path[i][j];}}floyd(); for (int i = 0; i < n; i++) {for (int j = 0; j < n; j++) {cout 2019. 1. 7.
백준 1697번 C++ #include #include #include using namespace std; int m, n;int z = 0;int visited[100001]; void bfs() {queue q;q.push(make_pair(m, z));visited[m] = 1; while (!q.empty()) {int M = q.front().first;int Z = q.front().second;q.pop(); if (M == n)cout m >> n; if (m == n) {cout 2019. 1. 7.

티스토리툴바