Pagini recente » Cod sursa (job #2806017) | Cod sursa (job #239251) | Cod sursa (job #1910623) | Cod sursa (job #759597) | Cod sursa (job #2255723)
#include <bits/stdc++.h>
#define ll long long
using namespace std;
//ifstream in("tst.in");
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n, dp[101][101];
int main(){
in >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
in >> dp[i][j];
for(int k = 1; k <= n; k++)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if((dp[i][k] && dp[k][j] && i != j) && (!dp[i][j] || dp[i][k] + dp[k][j] < dp[i][j]))
dp[i][j] = dp[i][k] + dp[k][j];
for(int i = 1; i <= n; i++, out << '\n')
for(int j = 1; j <= n; j++)
out << dp[i][j] << ' ';
return 0;
}