hdu 3631 Shortest Path（Floyd） - c++编程基础

#include
   
     #include
    
      #include
     
       const int N=305; using namespace std; int main() { int cas=0,n,m,q,i,j,k,x,y,t,g[305][305],vis[305],inf=1<<30; while(~scanf("%d%d%d",&n,&m,&q)) { if(n==0) break; if(cas) printf("\n"); memset(vis,0,sizeof(vis)); for(i=0; i
      
       t) g[x][y]=t; } printf("Case %d:\n",++cas); for(k=0;k
       
        =inf) printf("No such path\n"); else printf("%d\n",g[x][y]); } else { scanf("%d",&x); if(vis[x]) { printf("ERROR! At point %d\n",x); } else { vis[x]=1; for(i=0;i
        
         =inf||g[x][j]>=inf) continue; g[i][j]=min(g[i][j],g[i][x]+g[x][j]); } } } } } return 0; }

错误代码

/* ***********************************************
Author        :xryz
Email         :523689985@qq.com
Created Time  :6-10 22:57:56
File Name     :a.cpp
************************************************ */

#include 
   
     #include 
    
      #include 
     





       #include 
      
        #include 
       
         #include 
        
          #include 
         
           #include
           #include 
           
             #include 
            
              #include 
             
               #include 
              
                using namespace std; const int N=300+5; const int inf=1<<20; int edge[N][N],vis[N],use[N],n,m,q,dist[N]; int Dijkstra(int v0) { int i,j,k,minx,u; memset(vis,0,sizeof(vis)); for(i=0; i
               
                dist[u]+edge[u][k]&&use[k]) dist[k]=dist[u]+edge[u][k]; } } } int main() { int x,y,c,i,j,cas=0; //freopen("in.txt","r",stdin); while(~scanf("%d%d%d",&n,&m,&q)&&n&&m&&q) { memset(use,0,sizeof(use)); memset(edge,0,sizeof(edge)); for(i=0; i
                
                 c) edge[x][y]=c; } for(i=0; i