Cod sursa(job #2295766)
| Utilizator | Data | 3 decembrie 2018 22:23:59 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <bits/stdc++.h>
#define Dim 103
#define Max 10000009
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int N,M[Dim][Dim],V[Dim][Dim];
int main()
{
f>>N;
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
{
f>>M[i][j];
V[i][j]=Max;
}
for(int k=1;k<=N;k++)
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
V[i][j]=min(V[i][j],M[i][k]+M[k][j]);
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
{
if(V[i][j]!=Max) g<<V[i][j]<<" ";
else g<<0<<" ";
if(j==N) g<<'\n';
}
return 0;
}
