Cod sursa(job #1968033)
Utilizator | Huhurez Marius trutruvasilica | Data | 17 aprilie 2017 13:55:28 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int N=101;
int A[N][N];
int main()
{
int n,i,j,k;
fin>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++) fin>>A[i][j];
}
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if( i!=j && A[i][k] && A[k][j] && (A[i][k]+A[k][j]<A[i][j]||A[i][j]==0)) A[i][j]=A[i][k]+A[k][j];
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
fout<<A[i][j]<<" ";
}
fout<<"\n";
}
}