Cod sursa(job #1511264)
Utilizator | Data | 26 octombrie 2015 11:57:39 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.06 kb |
#include<stdio.h>
#include<algorithm>
using namespace std;
FILE *fin,*fout;
int n;
int a[101][101];
int main()
{
fin=fopen("royfloyd.in","r");
fout=fopen("royfloyd.out","w");
fscanf(fin,"%d",&n);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
fscanf(fin,"%d",&a[i][j]);
}
}
for(int k=1;k<=n;k++)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(i!=j)
{
if(a[i][k]!=0&&a[k][j]!=0&&a[i][j]!=0)
{
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
}
else if(a[i][k]!=0&&a[k][j]!=0&&a[i][j]==0)
{
a[i][j]=a[i][k]+a[k][j];
}
}
}
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
fprintf(fout,"%d ",a[i][j]);
}
fprintf(fout,"\n");
}
}