Cod sursa(job #3279080)
| Utilizator | Data | 21 februarie 2025 20:26:08 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream gout("royfloyd.out");
int main()
{
long long n,a[100][100];
fin>>n;
for(int i=0; i<n; ++i)
for(int j=0; j<n; ++j)
{
fin>>a[i][j];
}
for(int k=0; k<n; ++k)
for(int i=0; i<n; ++i)
for(int j=0; j<n; ++j)
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
for(int i=0; i<n; ++i)
{
for(int j=0; j<n; ++j)
if(a[i][j]!=2e9)gout<<a[i][j]<<' ';
else gout<<"0 ";
gout<<'\n';
}
return 0;
}
