Pagini recente » Istoria paginii runda/as1/clasament | Istoria paginii runda/asdf/clasament | Istoria paginii runda/abcdef | Cod sursa (job #2642271) | Cod sursa (job #1446944)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{ ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int i,j,n,k,a[100][100];
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];
// a[j][i]=a[i][k]+a[k][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];
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<endl;}
return 0;
}