초고교급 희망

#include using namespace std; int n, m; int room[51][51]; int dx[4] = { -1, 0, 1, 0 }; int dy[4] = { 0, 1, 0, -1 }; int start_x, start_y, start_d; int cnt = 0; int find_direction(int _d) { if (_d == 0) { return 3; } else { return _d - 1; } } void clean(int x, int y, int d) { if (room[x][y] == 0) { room[x][y] = 2; cnt++; } for (int i = 0; i < 4; i++) { int nd = find_direction(d); int nx = x + dx[..

#include using namespace std; bool whitepaper[101][101] = {0, }; int colorpapernumber, ans; void color(int x, int y) { for (int i = 0; i < 10; i++) { for (int j = 0; j < 10; j++) { whitepaper[x + i][y + j] = true; } } } int areacalculate(bool graph[101][101]) { int area = 0; for (int i = 0; i < 100; i++) { for (int j = 0; j < 100; j++) { if (graph[i][j]) { area++; } } } return area; } int main()..