Cod sursa(job #668095)

Utilizator Daniel30daniel Daniel30 Data 24 ianuarie 2012 13:18:43
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <cstdio>
using namespace std;
int n, a[105][105];
void cit()
{freopen("royfloyd.in","r",stdin);
 freopen("royfloyd.out","w",stdout);
 scanf("%d",&n);
 for (register int i = 1; i <= n; i++)
	for (register int j = 1; j <= n; j++) scanf("%d",&a[i][j]);
}
void roy()
{for (register int k = 1; k <= n; k++)
	for (register int i = 1; i <= n; i++)
		for (register int 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];
}
void afis()
{for (register int i = 1; i <= n; i++) {for (register int j = 1; j <= n; j++) printf("%d ",a[i][j]);pprintf("\n");}
}
int main()
{cit();
 roy();
 afis();
 return 0;
}