Mai intai trebuie sa te autentifici.
Cod sursa(job #1834240)
| Utilizator | Data | 24 decembrie 2016 08:39:46 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.97 kb |
#include <iostream>
#include <cstdio>
using namespace std;
#define NMAX 105
#define INFINITY 99999
int n;
int a[NMAX][NMAX];
void read()
{
scanf("%d ",&n);
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
{
scanf("%d ",&a[i][j]);
if(!a[i][j])
a[i][j]=INFINITY;
}
}
void royfloyd()
{
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
for(int k=1; k<=n; k++)
{
if(a[i][k] && a[k][j] && (a[i][j]>a[i][k]+a[k][j]))
a[i][j]=a[i][k]+a[k][j];
}
}
void print()
{
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
if(i==j || a[i][j]==INFINITY)
printf("%d ",0);
else printf("%d ",a[i][j]);
}
printf("\n");
}
}
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
read();
royfloyd();
print();
return 0;
}
