Pagini recente » Istoria paginii preoni-2008/runda-1/solutii | Monitorul de evaluare | Cod sursa (job #1835045) | Cod sursa (job #603479) | Cod sursa (job #3166285)
#include <iostream>
#include <fstream>
using namespace std;
const int NMAX=101;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
int W[NMAX][NMAX], D[NMAX][NMAX];
void afis(int a[][NMAX]) {
for (int i=1;i<=n;i++) {
for (int j=1;j<=n;j++)
g << a[i][j] << ' ';
g << '\n';
}
}
void royfloyd() {
for (int k=1;k<=n;k++) {
for (int i=1;i<=n;i++) {
for (int j=1;j<=n;j++) {
if (k==1)
D[i][j]=min(W[i][j], W[i][k]+W[k][j]);
else
D[i][j]=min(D[i][j], D[i][k]+D[k][j]);
}
}
}
}
int main()
{
f >> n;
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
f >> W[i][j];
royfloyd();
afis(D);
return 0;
}