하하하하 웃어요

#include using namespace std; int N; bool isPrimeNumber(int num) { if (num < 2) return false; for (int i = 2; i * i

#include #include using namespace std; vector graph[501]; bool visit[501] = {false, }; int bfs(int startV) { int numF = 0; visit[startV] = true; numF += graph[startV].size(); for (int i : graph[startV]) visit[i] = true; for (int i : graph[startV]) { for (int j : graph[i]) { if (visit[j] == false) { visit[j] = true; numF++; } } } return numF; } void input() { int numV, numE; int tmp1, tmp2; cin >..

#include using namespace std; bool space[29][29] = {false,}; double probability[4]; int directionX[4] = {1, -1, 0, 0}; int directionY[4] = {0, 0, -1, 1}; int moveCount; double dfs(int x, int y, int moveCount) { int nextX; int nextY; if (moveCount == 0) { return 1.0; } space[x][y] = true; double result = 0.0; for (int i = 0; i < 4; i++){ nextX = x + directionX[i]; nextY = y + directionY[i]; if (s..