Cod sursa(job #2753823)
| Utilizator | Data | 24 mai 2021 15:39:26 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n,a[110][110],d[110][110];
int main()
{
in>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
in>>a[i][j];
}
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++)
{
for(int j=1;j<=n;j++)
out<<a[i][j]<<" ";
out<<'\n';
}
return 0;
}
