Pagini recente » Cod sursa (job #2048369) | Cod sursa (job #2854436) | Cod sursa (job #2400408) | Cod sursa (job #28950) | Cod sursa (job #2859441)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main()
{
int n, t[105][105];
fin >> n;
for(int i = 1;i<=n;i++)
{
for(int j =1;j<=n;j++)
{
fin >> t[i][j];
}
}
for(int k = 1;k<=n;k++)
{
for(int i = 1;i<=n;i++)
{
for(int j = 1;j<=n;j++)
{
if(t[i][k] && t[k][j] && (t[i][j] > t[i][k] + t[k][j] || !t[i][j]) && i != j)
t[i][j] = t[i][k]+t[k][j];
}
}
}
for(int i = 1;i<=n;i++)
{
for(int j =1;j<=n;j++)
{
fout << t[i][j] << " ";
}
fout << '\n';
}
return 0;
}