Cod sursa(job #2519712)
| Utilizator | Data | 8 ianuarie 2020 12:29:40 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <bits/stdc++.h>
#define NMAX 105
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,har[NMAX][NMAX];
void read()
{
int i,j;
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>har[i][j];
}
void rf()
{
int k,i,j;
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
har[i][j]=min(har[i][j],har[i][k]+har[k][j]);
}
}
}
}
void show()
{
int i,j;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<har[i][j]<<' ';
g<<'\n';
}
}
int main()
{
read();
rf();
show();
return 0;
}
