Cod sursa(job #1626185)
Utilizator | Viktor Iuscenko viuscenko | Data | 2 martie 2016 23:20:17 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int m[101][101];
int main() {
int n;
fin >> n;
for(int i = 0; i < n; ++i)
for(int j = 0; j < n; ++j)
fin >> m[i][j];
for(int i = 0; i < n; ++i)
for(int j = 0; j < n; ++j)
for(int k = 0; k < n; ++k) {
if(i != j)
if(m[i][k] + m[k][j] < m[i][j])
m[i][j] = m[i][k] + m[k][j];
}
for(int i = 0; i < n; ++i) {
for(int j = 0; j < n; ++j)
fout << m[i][j] << " ";
fout << "\n";
}
}