1378：最短路径 shopth

 #include <bits/stdc++.h>

    
 using namespace std;
    
 #define N 105
    
 #define INF 0x3f3f3f3f
    
 int n, v0, dis[N][N];
    
 void floyd()
    
 {
    
     for(int k = 1; k <= n; ++k)
    
     for(int i = 1; i <= n; ++i)
    
         for(int j = 1; j <= n; ++j)
    
             dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
    
 }
    
 int main() 
    
 {
    
     int a;
    
     scanf("%d %d", &n, &v0);
    
     for(int i = 1; i <= n; ++i)
    
     for(int j = 1; j <= n; ++j)
    
     {
    
         if(scanf("%d", &a) == 1)//如果是正确输入，会返回1