Cod sursa(job #1511389)
Utilizator | Data | 26 octombrie 2015 18:29:11 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int i,j,k,n,M[100][100],C[100][100];
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%i",&n);
for (i=0;i<n;i++)
for (j=0;j<n;j++)
scanf("%i",&M[i][j]);
for (k=0;k<n;k++)
for (i=0;i<n;i++)
for (j=0;j<n;j++)
if (i!=j&&M[i][k]&&M[k][j])
if (((M[i][k]+M[k][j])<M[i][j])||M[i][j]==0)
M[i][j]=M[i][k]+M[k][j];
for (i=0;i<n;i++)
{
for (j=0;j<n;j++)
cout<<M[i][j]<<" ";
cout<<'\n';
}
}