Cod sursa(job #2354465)
| Utilizator | Data | 25 februarie 2019 12:29:21 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.73 kb |
#include <fstream>
#include <limits.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int a[101][101],n,i,j,k;
int main()
{
in>>n;
for (i=1;i<=n;++i)
{
for (j=1;j<=n;++j)
{
in>>a[i][j];
if (i!=j && !a[i][j]) a[i][j]=INT_MAX;
}
}
for (k=1;k<=n;++k)
{
for (i=1;i<=n;++i)
{
for (j=1;j<=n;++j)
{
if (a[i][k]!=INT_MAX && a[k][j]!=INT_MAX && a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
}
}
}
for (i=1;i<=n;++i)
{
for (j=1;j<=n;++j)
out<<a[i][j]<<" ";
out<<"\n";
}
}
