Cod sursa(job #3242324)
| Utilizator | Data | 11 septembrie 2024 08:45:01 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int sz = 500;
const int INF = 1e9;
int n;
int r[sz+5][sz+5];
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++){
fin>>r[i][j];
}
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(r[i][j]!=0 && r[i][k]!=0 && r[k][j]!=0)
r[i][j]=min(r[i][j],r[i][k]+r[k][j]);
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
fout<<r[i][j]<<' ';
fout<<'\n';
}
}
