Pagini recente » Cod sursa (job #3207645) | Cod sursa (job #2104420) | Cod sursa (job #1852891) | Cod sursa (job #271574) | Cod sursa (job #1169744)
#include <fstream>
using namespace std;
short a[103][103], i, j, k, n;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int main()
{
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 (i!=j && i!=k && k!=j && a[i][k]+a[k][j]<a[i][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<<'\n';
}
return 0;
}