Cod sursa(job #2037393)
| Utilizator | Data | 12 octombrie 2017 09:39:53 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n, M[105][105];
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f >> n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
f >> 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][j] = M[i][k] + M[k][j];
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j)
g << M[i][j] << " ";
g << "\n";}
}
