{"author_url":"https://blog.hatena.ne.jp/tnn-jp/","provider_url":"https://hatena.blog","url":"https://tnn-jp.hatenadiary.org/entry/20091107/1257579814","categories":["AIZU Online Judge","C/C++"],"published":"2009-11-07 16:43:34","image_url":null,"type":"rich","provider_name":"Hatena Blog","description":"Problem 0144 : Packet Transportation \u6709\u5411\u30b0\u30e9\u30d5\u306e\u6700\u77ed\u7d4c\u8def\u3092\u6c42\u3081\u308b\u554f\u984c\u3002 \u30ef\u30fc\u30b7\u30e3\u30eb-\u30d5\u30ed\u30a4\u30c9\u6cd5\u3067\u89e3\u3044\u305f\u3002 #include <iostream> #include <vector> using namespace std; #define MAX 9999 int n; vector< vector<int> > rtr; void Floyd(){ int i, j, k, l; for( i=1; i<=n; i++ ){ for( j=1; j<=n; j++ ){ for( k=1; k<=n; k++ ){ if( rtr[j][k] > rtr\u2026","blog_title":"tnn-jp.hatenadiary","height":"190","author_name":"tnn-jp","version":"1.0","width":"100%","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Ftnn-jp.hatenadiary.org%2Fentry%2F20091107%2F1257579814\" title=\"Volume 1 / 0144-&gt;0147 - tnn-jp.hatenadiary\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","title":"Volume 1 / 0144->0147","blog_url":"https://tnn-jp.hatenadiary.org/"}