Cod sursa(job #2750287)
| Utilizator | Data | 10 mai 2021 17:43:42 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int mat[101][101];
int main()
{
int n;
in>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
in>>mat[i][j];
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(mat[i][k]+mat[k][j]<mat[i][j])
mat[i][j]=mat[i][k]+mat[k][j];
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
out<<mat[i][j]<<' ';
out<<'\n';
}
return 0;
}
