Pagini recente » Cod sursa (job #1037929) | Cod sursa (job #2244417) | Cod sursa (job #1447200) | Solutii preONI 2007, Runda 2 | Cod sursa (job #2425742)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n, v[105][105];
void RoyFloyd()
{
for(int k=1;k<=n;k++)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if (v[i][k] && v[k][j] && (v[i][j] > v[i][k] + v[k][j] || !v[i][j]) && i != j)
v[i][j] = v[i][k] + v[k][j];
}
}
}
}
int main()
{
f >> n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
f >> v[i][j];
}
}
RoyFloyd();
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
g << v[i][j] << ' ';
g << '\n';
}
return 0;
}