Pagini recente » Cod sursa (job #1385112) | Cod sursa (job #2544494) | Cod sursa (job #563975) | Cod sursa (job #3170799) | Cod sursa (job #1766684)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
int a[101][101],i,j,n,m,x,y,k,q,poz;
void roy()
{
for(k = 1;k <= n;k++)
for(i = 1;i <= n;i++)
for(j = 1;j <= n;j++)
if(a[i][k] && a[k][j] &&(a[i][k] + a[k][j] < a[i][j] || !a[i][j]) && i != j)
a[i][j] = a[i][k] + a[k][j];
}
int main()
{
f >> n;
for(i = 1;i <= n;i++)
for(j = 1;j <= n;j++)
f >> a[i][j];
roy();
for(i = 1;i <= n;i++)
{
for(j = 1;j <= n;j++)
g << a[i][j] <<" ";
g << '\n';
}
}