Cod sursa(job #2359088)
| Utilizator | Data | 28 februarie 2019 16:51:25 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
#define INF = 1000000
using namespace std;
ifstream fin("royfloyd.in") ;
ofstream fout("royfloyd.out") ;
int n , v[105][105] ;
int main()
{
fin >> n ;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
fin >> v[i][j] ;
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(v[i][k] + v[k][j] < v[i][j])
v[i][j] = v[i][k] + v[k][j] ;
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
fout << v[i][j] << " " ;
fout << "\n" ;
}
return 0;
}
