1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 | #include <stdio.h> int arr[100][100] = { 0 }; void same(int y,int x,int n) { if (n < 1) return; int snum = arr[y][x],flag=0; for (int i = y; i < y+n; i++) { flag = 0; for (int j = x; j < x + n; j++) { if (snum != arr[i][j]) { flag = 1; break; } } if (flag == 1) break; } if (flag == 0) { if (snum == 1) { printf("1"); return; } if (snum == 0) { printf("0"); return; } } printf("("); same(y,x, n / 2); same(y, x + n / 2, n / 2); same(y + n / 2,x, n / 2); same(y + n / 2, x + n / 2 , n / 2); printf(")"); } int main() { int n; scanf("%d", &n); for (int i = 0; i < n; i++) { char str[100] = { 0 }; scanf("%s", &str); getchar(); for (int j = 0; j < n; j++) { arr[i][j] = (int)(str[j] - 48); } } same(0, 0, n); } | cs |
'알고리즘 > Divide and Conquer-일반' 카테고리의 다른 글
QuadTree 더블릿 (0) | 2019.03.05 |
---|---|
색종이 만들기 더블릿 (0) | 2019.02.13 |
catoring along 더블릿 (0) | 2019.02.13 |