Cod sursa(job #2316430)
| Utilizator | Data | 11 ianuarie 2019 18:16:39 | |
|---|---|---|---|
| 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 fin("royfloyd.in");
ofstream fout("royfloyd.out");
int A[101][101];
int n;
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
fin>>A[i][j];
for(int k=1; k<=n; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(A[i][k] && A[k][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++)
fout<<A[i][j]<<" ";
fout<<"\n";
}
return 0;
}
