초고교급 희망

#include #include using namespace std; vector solution(int brown, int yellow) { vector answer; int area = brown + yellow; for(int i = 3; i

#include #include using namespace std; int solution(vector maps) { int n = maps.size(); int m = maps[0].size(); vector dist(n, vector(m, -1)); dist[0][0]= 1; queue q; q.push({0, 0}); int dx[4] = {-1, 0, 1, 0}; int dy[4] = {0, 1, 0, -1}; while(!q.empty()) { int x = q.front().first; int y = q.front().second; q.pop(); for(int i = 0; i = 0 &&..

보호되어 있는 글입니다.

#include #include using namespace std; int answer; void dfs(vector& numbers, int target, int sum, int idx) { if(idx == numbers.size()) { if(sum == target) { answer++; } return; } dfs(numbers, target, sum + numbers[idx], idx + 1); dfs(numbers, target, sum - numbers[idx], idx + 1); } int solution(vector numbers, int target) { dfs(numbers, target, 0, 0); return answer; } 저 이거 10분만에 풀었어염 데헷>.

#include #include using namespace std; int answer = 0; void dfs(vector& numbers, int sum, int cnt, int index) { if(cnt == 3) { if(sum == 0) { answer++; } return; } for(int i = index; i < numbers.size(); i++) { dfs(numbers, sum + numbers[i], cnt + 1, i + 1); } } int solution(vector number) { for(int i = 0; i < number.size(); i++) { dfs(number, number[i], 1, i + 1); } return answer; } DFS 연습!!

#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()..

#include #define INF 987654321 using namespace std; int n; //도시 int m; //버스 int arr[101][101] = { 0 }; int x, y, z; int main() { cin >> n; cin >> m; for (int i = 1; i > y >> z; if (arr[x][y] > z) arr[x][y] = z; } //중간 노드 for (int k = 1; k