Cod sursa(job #3263201)
| Utilizator | Data | 13 decembrie 2024 20:04:09 | |
|---|---|---|---|
| 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 fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[105][105];
void citire()
{
fin>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
fin>>a[i][j];
}
void afisare()
{
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++)
fout<<a[i][j]<<" ";
fout<<"\n";
}
}
int main()
{
citire();
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
afisare();
}
