Cod sursa(job #2628632)
| Utilizator | Data | 16 iunie 2020 16:51:28 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.22 kb |
#include <bits/stdc++.h>
using namespace std;
FILE* si=fopen("royfloyd.in","r");
FILE* so=fopen("royfloyd.out","w");
int n,m[101][101];
int ct(int a,int b)
{
if(a<b)
{
return a;
}
return b;
}
int main()
{
fscanf(si,"%d",&n);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
fscanf(si,"%d",&m[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(m[i][k]!=0 && m[k][j]!=0)
{
if(m[i][j]==0)
{
m[i][j]=m[i][k]+m[k][j];
}
else
{
m[i][j]=ct(m[i][j],m[i][k]+m[k][j]);
}
}
}
}
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
fprintf(so,"%d ",m[i][j]);
}
fprintf(so,"\n");
}
fclose(si);
fclose(so);
return 0;
}
