Pagini recente » Cod sursa (job #2626748) | Cod sursa (job #1300464) | Istoria paginii runda/4321/clasament | Cod sursa (job #3123663) | Cod sursa (job #1290504)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int a[200][200], n, i, j, k;
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];
}
}
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(a[i][j]>a[i][k]+a[k][j]) {a[i][j]=a[i][k]+a[k][j];}
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
g<<a[i][j]<<" ";
} g<<endl;
}
return 0;
}