Cod sursa(job #2311975)
| Utilizator | Data | 3 ianuarie 2019 22:36:03 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[100][100];
int main()
{
int n, i, j, k;
f >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
f >> a[i][j];
for (int k = 0; k < n; k++)
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
if (a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
}
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++)
g<<a[i][j]<<" ";
g<<"\n";
}
}
