Cod sursa(job #2812498)
| Utilizator | Data | 4 decembrie 2021 16:51:30 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int v[105][105],n;
int main()
{
in>>n;
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
in>>v[i][j];
for(int k=1;k<=n;++k)
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
v[i][j]=min(v[i][j],v[i][k]+v[k][j]);
for(int i=1;i<=n;++i)
{
for(int j=1;j<=n;++j)
out<<v[i][j]<<' ';
out<<'\n';
}
return 0;
}
