problem-solving/BOJ_11403.cpp at main · junhee-won/problem-solving · 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
// 21/10/24

#include <iostream>
using namespace std;

int n;
bool edge[100][100];

void Input(void)
{
    cin >> n;
    for (int i=0; i<n; i++)
    {
        for (int j=0; j<n; j++)
            cin >> edge[i][j];
    }
}

void Solve(void)
{
    for (int i=0; i<n; i++)
    {
        for (int j=0; j<n; j++)
        {
            for (int k=0; k<n; k++)
            {
                if (edge[j][i] && edge[i][k])
                    edge[j][k] = true;
            }
        }
    }
}

void Output(void)
{
    for (int i=0; i<n; i++)
    {
        for (int j=0; j<n; j++)
            cout<< edge[i][j] <<" ";
        cout << "\n";
    }
}

int main(void)
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    Input();
    Solve();
    Output();
    return 0;
}