Cod sursa(job #2965207)
Utilizator | Data | 14 ianuarie 2023 17:42:45 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#define DIM 101
#define INF 5000001
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,a[DIM][DIM];
int main() {
fin>>n;
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
fin>>a[i][j];
for (int k=1;k<=n;k++)
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
if (a[i][k]!=0 && a[k][j]!=0 && a[i][k]+a[k][j]<a[i][j])
a[i][j]=a[i][k]+a[k][j];
for (int i=1;i<=n;i++) {
for (int j=1;j<=n;j++)
fout<<a[i][j]<<" ";
fout<<"\n";
}
return 0;
}