1155. Can I Post the Lette

#include "iostream" #include "memory.h" #include "Cstdio" using namespace Std;int road[201][201];int N, m;/* use Freud algorithm to solve this problem , if two cities can be connected, the distance is 0*/inline void Floyd () {for (int i = 0; i < n; i++) {for (int j = 0; J < N; j + +) {for (int k = 0; K &L T N k++) {if (Road[j][k] > (road[j][i] + road[i][k])) {Road[j][k] = Road[j][i] + road[i][k];}}}} int main () {while (CIN >> n && N) {if (0 = = N) break;for (int i = 0, i < 201; i++) {for (int j = 0; J < 20 1; J + +) {road[i][j] = 100;} Road[i][i] = 0;} CIN >> m;for (int i = 0; i < m; i++) {int A, b;cin >> a >> b;road[a][b] = 0;road[b][a] = 0;} Floyd (); if (road[0][n-1] = = 0) {printf ("I can post the letter\n");} else{printf ("I can ' t post the letter\n");}} return 0;}

1155. Can I Post the Lette