Pagini recente » Cod sursa (job #899449) | Cod sursa (job #2599397) | Cod sursa (job #1590233) | Cod sursa (job #2913486) | Cod sursa (job #3030256)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int INF = 1e9+7;
int n,m;
int a[101][101];
int d[101][101]={};
int main()
{
fin>>n;
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n;j++)
{
fin>>a[i][j];
}
}
for (int k = 1; k <= n; k++)
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (a[i][k] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j) a[i][j] = a[i][k] + a[k][j];
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n;j++)
{
fout << a[i][j] << ' ';
}fout << endl;
}
return 0;
}