Pagini recente » Cod sursa (job #3324283) | Diferente pentru problema/dw intre reviziile 11 si 3 | Cod sursa (job #3358608) | Cod sursa (job #861309) | Cod sursa (job #1729950)
#include <iostream>
#include <fstream>
using namespace std;
int a[100][100],n;
void roy()
{
int k,i,j;
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][j]>a[i][k]+a[k][j]) || (!a[i][j] && i!=j))
a[i][j]=a[i][k]+a[k][j];
}
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f>>n;
int i,j;
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<<endl;
}
}