Pagini recente » Cod sursa (job #2114505) | Cod sursa (job #1112453) | Cod sursa (job #547055) | Cod sursa (job #665761) | Cod sursa (job #3266629)
#include <bits/stdc++.h>
using namespace std;
int n;
int ad[105][105];
int di[105][105];
int main()
{
freopen("C:/Users/ioanc/Documents/vscode/royflyod.in", "r", stdin);
freopen("C:/Users/ioanc/Documents/vscode/royflyod.out", "w", stdout);
cin >> n;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
cin >> ad[i][j];
if(ad[i][j] == 0)
ad[i][j] = 100005;
}
}
for(int an = 1; an <= n; an++)
{
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
if(i == j || j == an || i == an)
{
continue;
}
ad[i][j] = min(ad[i][j], ad[i][an] + ad[an][j]);
}
}
}
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= n; j++)
{
if(ad[i][j] == 100005)
cout << "0 ";
else
cout << ad[i][j] << " ";
}
cout << "\n";
}
}