본문 바로가기

CodingTest87

[Baekjoon] 2667번 단지번호붙이기 #include #include #include #include using namespace std;vector> Map;vector> Visited;int Mx[4] = { -1, 1, 0, 0 };int My[4] = { 0, 0, -1, 1 };void DFS(int X, int Y, int Size, int& Count){ Visited[X][Y] = true; Count++; for (size_t i = 0; i = Size || Ny = Size) continue; if (Map[Nx][Ny] == 1 && Visited[Nx][Ny] == false) { DFS(Nx, Ny, Size, Count); .. 2025. 5. 11.
[Baekjoon] 2178번 미로 탐색 #include #include #include #include using namespace std;vector> Miro;vector> Visited;int Mx[4] = { -1, 1, 0, 0 }; int My[4] = { 0, 0, -1, 1 };int main() { int N, M; cin >> N >> M; Miro.resize(N, vector(M)); Visited.resize(N, vector(M, false)); for (size_t i = 0; i > Input; for (size_t j = 0; j > Q; Q.push({ 0, 0 }); Visited[0][0] == true; while (Q.empty() == false).. 2025. 5. 11.
[Baekjoon] 1260번 DFS와 BFS #include #include #include #include using namespace std;const int MaxCount = 10001;vector Graph[MaxCount];bool VisitedDFS[MaxCount] = { false };void DFS(int V){ VisitedDFS[V] = true; cout Queue; bool VisitedBFS[MaxCount] = { false }; Queue.push(V); VisitedBFS[V] = true; while (Queue.empty() == false) { int front = Queue.front(); Queue.pop(); cout > N >>.. 2025. 5. 11.
[Baekjoon] 1920번 수 찾기 #include #include using namespace std;int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int InputCount; cin >> InputCount; map Numbers; for (size_t i = 0; i > InputNumber; Numbers[InputNumber] = 1; } cin >> InputCount; for (size_t i = 0; i > InputNumber; cout 2025. 5. 11.
[Baekjoon] 2751번 수 정렬하기 2 #include #include #include using namespace std;int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int InputCount; cin >> InputCount; vector Inputs; for (size_t i = 0; i > InputNumber; Inputs.push_back(InputNumber); } sort(Inputs.begin(), Inputs.end()); // less(); 오름차순 // greater(); 내림차순 for (auto Number : Inputs) cout 2025. 5. 10.
[Baekjoon] 9012번 괄호 #include #include #include using namespace std;int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int InputCount; cin >> InputCount; for (size_t i = 0; i > InputStr; stack Chars; bool Cout = false; for (size_t i = 0; i 2025. 5. 10.

티스토리툴바