Cod sursa(job #2871868)
| Utilizator | Data | 15 martie 2022 21:06:21 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream reader ("royfloyd.in");
ofstream writer ("royfloyd.out");
int n;
reader>>n;
int a[n][n];
for(int i=0;i<n;++i)
for(int j=0;j<n;++j)
a[i][j]=0;
for(int i=0;i<n;++i)
for(int j=0;j<n;++j)
reader>>a[i][j];
for(int k=0;k<n;++k)
for(int i=0;i<n;++i)
for(int j=0;j<n;++j)
if(a[i][k]+a[k][j]<a[i][j])
a[i][j]=a[i][k]+a[k][j];
for(int i=0;i<n;++i)
{
for(int j=0;j<n;++j)
writer<<a[i][j]<<" ";
writer<<'\n';
}
return 0;
}
