1378：最短路径(shopth)

 //示例代码 floyd

    
 #include <bits/stdc++.h>
    
 using namespace std;
    
 int f[85][85];
    
 int n,v;
    
 int main()
    
 {
    
 	memset(f,0x3f,sizeof(f));
    
 	string s;
    
 	cin>>n>>v;
    
 	for(int i=1;i<=n;i++) f[i][i]=0;
    
 	for(int i=1;i<=n;i++)
    
 		for(int j=1;j<=n;j++){
    
 			cin>>s;
    
 			if(s=="-") continue;
    
 			else f[i][j]=atoi(s.c_str());
    
 		}
    
 	for(int k=1;k<=n;k++)
    
 		for(in