ProblemSolving/1992.cpp at main · readable-ko/ProblemSolving · GitHub

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 <iostream>
#define SETTING ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
using namespace std ;
int N ;
bool arr[65][65] ;

void DivAndCon(int row, int col, int size)
{
    bool check = arr[row][col];
    bool flag = 1 ;

    if(size == 1)
    {
        cout << check ; return ;
    }

    for(int i = row ; i < size + row ; i++)
    {
        for(int j = col ; j < size + col ; j++)
        {
            if(check != arr[i][j])
            {
                flag = 0 ; break ;
            }
        }
        if(!flag) break ;
    }

    if(flag) {cout << check; return; }
    else
    {
        cout << "(" ;
        DivAndCon(row, col, size / 2) ;
        DivAndCon(row, col + size / 2, size / 2) ;
        DivAndCon(row + size / 2, col, size / 2) ;
        DivAndCon(row + size / 2, col + size / 2, size / 2) ;
        cout << ")" ;
    }
}

int main()
{
    SETTING ;
    cin >> N ;
    string temp ;
    for(int i = 1 ; i <= N ; i++)
    {
        cin >> temp ;
        for(int j = 1 ; j <= N ; j++)
            arr[i][j] = temp[j-1] - '0';
    }

    DivAndCon(1, 1, N) ;
}