Pagini recente » Cod sursa (job #813693) | Cod sursa (job #1873091) | Cod sursa (job #2163946) | Cod sursa (job #353225) | Cod sursa (job #2681351)
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n,m;
int a[105][105];
void cit()
{
in>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
in>>a[i][j];
}
void RoyWarshall()
{
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] and a[k][j] and (!a[i][j] or a[i][k]+a[k][j]<a[i][j]) and i!=j)
a[i][j]=a[i][k]+a[k][j];
}
void afis()
{
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
out<<a[i][j]<<' ';
out<<'\n';
}
}
int main()
{
cit();
RoyWarshall();
afis();
return 0;
}