Pagini recente » Cod sursa (job #3295448) | Cod sursa (job #577823) | Cod sursa (job #1240560) | Cod sursa (job #1572049) | Cod sursa (job #3251498)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n;
int m[1001][1001];
int main()
{
fin >> n;
for(int i = 1; i<=n; i++)
for(int j = 1; j<=n; j++)
{
fin >> m[i][j];
if(m[i][j] == 0)
m[i][j] = 1000000000;
}
for(int k = 1; k<=n; k++)
for(int i = 1; i<=n; i++)
for(int j = 1; j<=n; j++)
if(i != j)
m[i][j] = min(m[i][j], m[i][k] + m[k][j]);
for(int i = 1; i<=n; i++)
{
for(int j = 1; j<=n; j++)
{
if(m[i][j] == 1000000000)
fout << 0 << " ";
else
fout << m[i][j] << ' ';
}
fout << '\n';
}
return 0;
}