Pagini recente » Cod sursa (job #321010) | Cod sursa (job #2316186) | Cod sursa (job #2699147) | Cod sursa (job #79059) | Cod sursa (job #1185842)
#include<iostream>
#include<fstream>
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=0;i<n;i++)
for(j=0;j<n;j++)f>>t[i][j];
for(int k = 0; k <n; k++)
for(i = 0; i <n; i++)
for(j = 0; 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=0;i<n;i++){
for(j=0;j<n;j++)g<<t[i][j]<<' ';g<<'\n';
}
g.close();
return 0;
}