Cod sursa(job #1784943)
| Utilizator | Data | 20 octombrie 2016 18:05:50 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <bits/stdc++.h>
#define N 101
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n, w[N][N],d[N][N];
int main()
{
in>>n;
for(int i=1; i<=n; ++i)
for(int j=1; j<=n; ++j)
{
in>>w[i][j];
d[i][j]=w[i][j];
}
for(int k=1; k<=n; ++k)
for(int i=1; i<=n; ++i)
for(int j=1; j<=n; ++j)
d[i][j]=min(d[i][j],d[i][k]+d[k][j]);
for(int i=1; i<=n; ++i)
{
for(int j=1; j<=n; ++j)
out<<d[i][j]<<' ';
out<<'\n';
}
return 0;
}
