Cod sursa(job #1125244)
Utilizator | Data | 26 februarie 2014 16:31:18 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <cstdio>
using namespace std;
long n,i,j,a[101][101],k;
int main()
{
freopen("royfloyd.in","r",stdin);
freopen("royfloyd.out","w",stdout);
scanf("%ld",&n);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++){
scanf("%ld",&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] && a[k][j] && (a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
a[i][j]=a[i][k]+a[k][j];
for(i=1;i<=n;i++){
for(j=1;j<=n;j++)
printf("%ld ",a[i][j]);
printf("\n");
}
return 0;
}