Hello World!

https://github.com/Bloom-booth/BloomBooth 프로젝트" data-og-description="2024-2학기 모바일소프트웨어 3팀 프로젝트. Contribute to Bloom-booth/BloomBooth development by creating an account on GitHub." data-og-host="github.com" data-og-source-url="https://github.com/Bloom-booth/BloomBooth" data-og-url="https://github.com/Bloom-booth/BloomBooth" data-og-image="https://scrap.kakaocdn.net/dn/hNkwU/hyXWrkq4xk/RDYrZEsphR..

https://www.acmicpc.net/problem/30106코드#include #include using namespace std;#define MAX 501#define FASTIO ios::sync_with_stdio(false); cin.tie(NULL);typedef pair pi;int n, m, k, arr[MAX][MAX], ans;int dx[4] = { 1, -1, 0, 0 }, dy[4] = { 0, 0, 1, -1 };bool visit[MAX][MAX];void bfs(int x, int y) { queue q; q.push({ x, y }); while (!q.empty()) { int nx = q.front().first; int ny = q.front().second..