Cod sursa(job #2559528)
Utilizator | Terec Andrei-Sorin [email protected] | Data | 27 februarie 2020 13:01:59 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.71 kb |
#include <iostream>
#include <fstream>
#define INF 1000000000
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
int a[101][101];
int main()
{
f>>n;
int i,j,k;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
f>>a[i][j];
if(a[i][j] == 0)
a[i][j] = INF;
}
f.close();
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j)
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<(a[i][j] == INF? 0 : a[i][j])<<' ';
g<<'\n';
}
g.close();
return 0;
}