![[백준 1992번] 쿼드트리 (C++)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FlG3JA%2FbtsyTof1ts5%2FAAAAAAAAAAAAAAAAAAAAAHuTvvc5teyzO647S1vp3SvVxNaNhhtA3VoT3p9Z8EFf%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DApnot4bkktQfqy%252BblaIpjFj7iAo%253D)
PS/백준 알고리즘[BOJ]2023. 10. 21. 15:49[백준 1992번] 쿼드트리 (C++)
//white: 0, black: 1 #define SIZE 64 #include #include #include using namespace std; char col; char map[SIZE][SIZE]; // change - true, not change - false bool check(int x1, int y1, int x2, int y2) { col = map[x1][y1]; for (int i = x1; i < x2; i++) { for (int j = y1; j < y2; j++) { if (col != map[i][j]) return true; } } return false; } void dc(int size, int x, int y) { if (size == 1) { cout str; ..