Pagini recente » Cod sursa (job #1082560) | Cod sursa (job #45335) | huehuhue | Cod sursa (job #2178888) | Cod sursa (job #871050)
Cod sursa(job #871050)
#include <iostream>
#include<fstream>
using namespace std;
int a[111][111],i,j,k,n;
void rf()
{
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]=a[i][k]+a[k][j];
}
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
rf();
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<endl;
}
return 0;
}