Pagini recente » Cod sursa (job #1879026) | Cod sursa (job #449476) | Cod sursa (job #2900185) | Cod sursa (job #2617575) | Cod sursa (job #2543267)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
short n, v[105][105];
int main (){
fin>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
fin>>v[i][j];
for(int nod=1; nod <= n; nod++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(v[i][j] > v[i][nod] + v[nod][j])
v[i][j]=v[i][nod] + v[nod][j];
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++)
fout<<v[i][j]<<" ";
fout<<"\n";
}
return 0;
}