Cod sursa(job #2771640)
Utilizator | Balanici Andrei Daniel AndreiDelta | Data | 28 august 2021 13:28:04 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
#define Dim 101
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
long long N,A[Dim][Dim];
int main()
{
f>>N;
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
{
f>>A[i][j];
if(A[i][j]==0 && i!=j ) A[i][j]=INT_MAX;
}
for(int k=1;k<=N;k++)
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
A[i][j]=min(A[i][j],A[i][k]+A[k][j]);
for(int i=1;i<=N;i++,g<<'\n')
for(int j=1;j<=N;j++)
g<<A[i][j]<<' ';
return 0;
}