Cod sursa(job #1987326)
Utilizator | Tempfli Levente2 leevii | Data | 30 mai 2017 12:56:29 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,a[105][105];
int main()
{
int n,i,j,k;
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>a[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
if(a[i][k]!=0 && a[k][j]!=0 && (a[i][j]>a[i][k]+a[k][j]) && i!=j) a[i][j]=a[i][k]+a[k][j];
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
fout<<a[i][j]<<" ";
}
fout<<"\n";
}
}