Pagini recente » Cod sursa (job #3322160) | Monitorul de evaluare | Cod sursa (job #3322164) | Cod sursa (job #1729947) | Cod sursa (job #1729946)
#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]<<" ";
cout<<endl;
}
}