Pagini recente » Cod sursa (job #2657444) | Cod sursa (job #2517098) | Cod sursa (job #2405897) | Cod sursa (job #2181724) | Cod sursa (job #2632729)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
typedef long long ll;
const int oo = 0x3f3f3f3f;
int n, dp[105][105];
int main()
{
ios_base::sync_with_stdio(false);
fin.tie(0);
fin >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j){
fin >> dp[i][j];
if (!dp[i][j]) dp[i][j] = oo;}
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
for (int i = 1; i <= n; ++i){
for (int j = 1; j <= n; ++j){
if (dp[i][j] == oo || i == j) fout << "0 ";
else fout << dp[i][j] << " ";}
fout << "\n";}
return 0;
}