Cod sursa(job #1940696)
| Utilizator | Data | 26 martie 2017 19:26:52 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int a[1001][1001],n;
int main()
{
fin >> n;
for(int i = 0; i<n; i++)
for(int j = 0; j<n; j++)
fin >> a[i][j];
for(int i = 0; i<n; i++)
for(int j=0; j<n; j++)
for(int k=0; k<n; k++)
if(i!=j && j!=k && i!=k)
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++)
fout << a[i][j] << ' ';
fout<<'\n';
}
return 0;
}
