Cod sursa(job #2353820)
| Utilizator | Data | 24 februarie 2019 16:59:07 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
//#include "pch.h"
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int main()
{
int a[100][100],n;
fin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
fin >> a[i][j];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
for (int k = 0; k < n; k++)
if (a[j][k] > a[j][i] + a[i][k])
a[j][k] = a[j][i] + a[i][k];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++)
fout << a[i][j] << " ";
fout << endl;
}
}
