Pagini recente » Cod sursa (job #2402644) | Cod sursa (job #2402356) | Cod sursa (job #2775302) | Cod sursa (job #1757714) | Cod sursa (job #2095630)
#include <fstream>
#include <vector>
#define Nmax 109
#define INF 2^30
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,m,c[Nmax][Nmax],d[Nmax][Nmax];
void RoyFloyd() {
for (int i=1; i<=n; ++i)
for (int j=1; j<=n; ++j)
if (!c[i][j])
d[i][j]=0;
else d[i][j]=c[i][j];
for (int k=1; k<=n; ++k)
for (int i=1; i<=n; ++i)
for (int j=1; j<=n; ++j)
if (c[i][k] && c[k][j] && d[i][k]+d[k][j]<d[i][j])
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>>c[i][j];
RoyFloyd();
for (int i=1; i<=n; ++i) {
for (int j=1; j<=n; ++j)
g<<d[i][j]<<' ';
g<<'\n';
}
}