Pagini recente » newcomers_2 | Monitorul de evaluare | Cod sursa (job #1065570) | Cod sursa (job #2253518) | Cod sursa (job #2202059)
#include <iostream>
#include <stdio.h>
using namespace std;
FILE *f,*g;
int n;
int a[100][1002];
void read ()
{
fscanf(f,"%d",&n);
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
fscanf(f,"%d",&a[i][j]);
}
void roy_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[j][i])
if(a[i][k]+a[k][j]<a[i][j])
a[i][j]=a[i][k]+a[k][j];
}
void write()
{
for(int i=1; i<=n; i++,fprintf(g,"\n"))
for(int j=1; j<=n; j++)
fprintf(g,"%d ",a[i][j]);
}
int main()
{
f=fopen("royfloyd.in","r");
g=fopen("royfloyd.out","w");
read();
roy_floyd();
write();
fclose(f);
fclose(g);
return 0;
}