Mai intai trebuie sa te autentifici.
Cod sursa(job #1844670)
Utilizator | Data | 10 ianuarie 2017 11:51:29 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.69 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,i,j,k,p[1010][1010];
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
f>>p[i][j];
if(p[i][j]==0)
p[i][j]=1000000;
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j&&i!=k&&j!=k)
p[i][j]=min(p[i][j],p[i][k]+p[k][j]);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
if(p[i][j]==1000000)
g<<0<<' ';
else
g<<p[i][j]<<' ';
g<<'\n';
}
return 0;
}