[백준]11403 경로 찾기

2020-03-13 76 words One minute

Contents

https://www.acmicpc.net/problem/11403

풀이:

[C++]플로이드-와샬 알고리즘(Floyd-Warshall Algorithm) 참고

코드:

사용언어 : c++

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13


#include <iostream>
#define F(i,n)for(int i=0;i<n;i++)
using namespace std;
int n, a[102][102];
int main() {
	cin >> n;
	F(i, n)	F(t, n)	cin >> a[i][t];
	F(u, 2) F(i, n)	F(t, n)	F(y, n) if(!a[i][t]) a[i][t] = a[i][y] & a[y][t];
	F(i, n) {
		F(t, n) cout << a[i][t] << " ";
		cout << endl;
	}
}