Pagini recente » Cod sursa (job #2665353) | Cod sursa (job #1891978) | Cod sursa (job #2983434) | Cod sursa (job #2091303) | Cod sursa (job #1185841)
#include<iostream>
#include<fstream>
#include<math.h>
using namespace std;
ifstream f;
ofstream g;
int i,j,n,t[100][100];
int main()
{
f.open("royfloyd.in");
g.open("royfloyd.out");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)f>>t[i][j];
for(int k = 1; k <=n; k++)
for(i = 1; i <=n; i++)
for(j = 1; j <=n; j++)
if(t[i][k] && t[k][j] && i != j && (t[i][j] > t[i][k] + t[k][j] || !t[i][j]))
t[i][j] = t[i][k] + t[k][j];
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)g<<t[i][j]<<' ';g<<'\n';
}
g.close();
}