HDU 1596 find the safest road .

find the safest road

Time Limit: 10000/5000 MS (Java/Others)????Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1533????Accepted Submission(s): 581

42868042011-07-29 14:55:02Accepted15963562MS6708K647 BC++#include <iostream>using namespace std;#define MAXI 1011double g[MAXI][MAXI];int n;void Floyd(){ int k, u, v; for (k = 0; k < n; k++) for (u = 0; u < n; u++) for (v = 0; v < n; v++) if (g[u][k] * g[k][v] > g[u][v]) g[u][v] = g[u][k] * g[k][v];}int main(){ int q, u, v; while (scanf("%d", &n) != EOF) { for (u = 0; u < n; u++) for (v = 0; v < n; v++) scanf("%lf", g[u] + v); Floyd(); scanf("%d", &q); while (q--) { scanf("%d%d", &u, &v); u--; v--; if (g[u][v] == 0.0) printf("What a pity!\n"); else printf("%.3lf\n", g[u][v]); } } return 0;}

?真系好水…………