Cod sursa(job #2435262)
| Utilizator | Data | 3 iulie 2019 15:31:57 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <iostream>
#include<bits/stdc++.h>
#define N_MAX 101
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main()
{
int m[N_MAX][N_MAX];
int n;
fin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
fin>>m[i][j];
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
if(m[i][k] && m[k][j] && m[i][j]>(m[i][k]+m[k][j]))
m[i][j]=m[i][k]+m[k][j];
}
for(int i=1;i<=n;i++)
{for(int j=1;j<=n;j++)
{
fout<<m[i][j]<<' ';
}
fout<<'\n';
}
return 0;
}
