Pagini recente » Diferente pentru preoni-2006/runda-2/solutii intre reviziile 9 si 18 | Cangrena | Istoria paginii utilizator/dj-lancer | Cod sursa (job #1776440) | Cod sursa (job #257414)
Cod sursa(job #257414)
#include <stdio.h>
int n, a[100][100];
void citire() {
FILE *fin = fopen("royfloyd.in","r");
fscanf(fin,"%d",&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
fscanf(fin,"%d",&a[i][j]);
}
void afisare() {
FILE *fout = fopen("royfloyd.out","w");
for(int i=1;i<=n;i++) {
for(int j=1;j<=n;j++)
fprintf(fout,"%d",a[i][j]);
fprintf(fout,"\n");
}
}
void floyd() {
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if((a[i][j] > a[i][k] + a[k][j]) && i != j)
a[i][j] = a[i][k] + a[k][j];
}
void main() {
citire();
floyd();
afisare();
}