Cod sursa(job #2486534)
| Utilizator | Data | 3 noiembrie 2019 02:13:31 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
int a[101][101],n;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
void royfloyd()
{
int i,j,k;
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][k]!=0&&a[k][j]!=0&&((a[i][j]>a[i][k]+a[k][j])||(a[i][j]==0&&i!=j)))a[i][j]=a[i][k]+a[k][j];
}
int main()
{
int i, j;
in>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
in>>a[i][j];
royfloyd();
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
out<<a[i][j]<<" ";
out<<"\n";
}
return 0;
}
