Time Limit: 1s
Memory Limit: 128MB
4 2 1 1 1 1 1 1 1 1 1 1 1 0 0 1 2 1 0 1 0 1 0 1 0 1 3 1 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1
2 0 1 3 HINT You can use floyd algorithm to solve this problem. It's format are like this: For（int k=1;k<=n;k++） For(int i=1;i<=n;i++) For(int j=1;j<=n;j++) { ……………; }