Pagini recente » Cod sursa (job #2874823) | Cod sursa (job #1115210) | Cod sursa (job #2610877) | Cod sursa (job #1156395) | Cod sursa (job #2205409)
#include<iostream>
#include<fstream>
using namespace std;
ifstream in("royfloyd.in");
//ofstream out("royfloyd.out");
const int N = 101;
int d[N][N][N];
int n;
int main()
{
freopen("royfloyd.out","w",stdout);
in>>n;
for(int i=1; i<=n; ++i)
for(int j=1; j<=n; ++j)
in>>d[i][j][0];
for(int k=1; k<=n; ++k)
for(int i=1; i<=n; ++i)
for(int j=1; j<=n; ++j)
d[i][j][k] = min(d[i][j][k-1], d[i][k][k-1] + d[k][j][k-1]);
for(int i=1; i<=n; ++i){
for(int j=1; j<=n; ++j)
cout<<d[i][j][n]<<" ";
cout<<"\n";
}
return 0;
}