https://www.acmicpc.net/problem/11404 플로이드. #include #include #include #include using namespace std; int n,m,v,a,b,c; int adj[101][101]; int w[101][101]; void floyd() { for(int k=1;kn>>m; for(int i=0;i>a>>b>>c; if(w[a][b]==0) w[a][b] = c; else w[a][b] = min(w[a][b], c); } floyd(); for(int i=1;i