Peter's blog

#define _CRT_SECURE_NO_WARNINGS #include #include #include #include #include using namespace std; //순열 사이클 int arr[1001]; bool check[1001]; void cycledfs(int node) { check[node] = true; int next = arr[node]; if (check[next] == false) { cycledfs(next); } else return; } int main() { int t; cin >> t; while (t--) { int n; cin >> n; for (int i = 1; i

#define _CRT_SECURE_NO_WARNINGS #include #include #include using namespace std; // 백준 2667 단지번호 붙이기 // 2차원 bfs로 풀이 int grid[26][26]; int check[26][26]; int block[700] = { 0, }; int dx[4] = { -1, 1, 0, 0 }; int dy[4] = { 0,0,-1,1 }; int n; void bfs(int x,int y,int bcnt) { queue q; q.push(make_pair(x, y)); int acnt = 1; check[x][y] = bcnt; while (!q.empty()) { x = q.front().first; y = q.front().se..

#define _CRT_SECURE_NO_WARNINGS #include #include #include using namespace std; bool check[51][51]; int grid[51][51]; int dx[8] = { -1,0,1,-1,1,-1,0,1 }; int dy[8] = { -1,-1,-1,0,0,1,1,1 }; int n, m; void dfs(int x, int y) { check[x][y] = true; for (int i = 0; i = 1 && nx = 1 && ny > m >> n; if (n == 0 && m == 0) break; for (int i = 1; i

#define _CRT_SECURE_NO_WARNINGS #include #include #include using namespace std; int check[101][101]; //방문여부와 거리 합산하여 저장한다. int grid[101][101]; int dx[4] = {-1,0,0,1 }; int dy[4] = { 0,-1,1,0 }; int n, m; int bfs(int x, int y){ queue q; check[1][1] = 1; q.push(make_pair(x, y)); while (!q.empty()) { x = q.front().first; y = q.front().second; q.pop(); for (int i = 0; i < 4; i++) { int nx = x + dx[i..