0_0_13802643_27229.cpp:1:1001: fatal error: GCC4.9.2/lib/gcc/x86_64-w64-mingw32/4.9.2/include/stdio.h>in: Invalid argument
#include <stdio.h>int map[201][201] = {0};int path[201][201] = {0};void write(int i , int j) //递归输出路径{ if (path[i][j] > 0) { write(i , path[i][j]); write(path[i][j] , j); } else printf("-->%d" , j);}int main(){ int i , j , k , s , t , w , n , m; //读入数据 scanf("%d %d" , &n , &m); for (i = 0; i < m; i ++) { scanf("%d %d %d" , &s , &t , &w); map[s][t] = w; map[t][s] = w; } //Floyed for (k = 1; k <= n; k ++) for (i = 1; i <= n; i ++) if (k != i) for (j = 1; j <= n; j ++) if ((j != i) && (j != k) && (map[i][k] > 0) && (map[k][j] > 0) &&((map[i][j] == 0) || (map[i][k] + map[k][j] < map[i][j]))) { map[i][j] = map[i][k] + map[k][j]; path[i][j] = k; } //此时map[i][j]表示i到j的最短路 //输出路径和最短距离 for (i = 1; i <= n; i ++) for (j = 1; j <= n; j ++) if (i != j) { printf("%d ==> %d : %d %d" , i , j , map[i][j] , i); write(i , j); printf("\n"); } getchar(); getchar(); return 0;}
^
compilation terminated.
|
