Cod sursa(job #1627046)
| Utilizator | Data | 3 martie 2016 13:47:55 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <stdio.h>
using namespace std;
int a[101][101];
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
int n, i, j, k;
scanf("%d",&n);
for(i=1;i<=n;i++) {
for(j=1;j<=n;j++) {
scanf("%d",&a[i][j]);
if(a[i][j] == 0 && i!=j)
a[i][j] = 999999999;
}
}
for(k=1;k<=n;k++) {
for(i=1;i<=n;i++) {
for(j=1;j<=n;j++) {
if(a[i][k]+a[k][j] < a[i][j])
a[i][j] = a[i][k]+a[k][j];
}
}
}
for(i=1;i<=n;i++) {
for(j=1;j<=n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
}
