Mai intai trebuie sa te autentifici.
Cod sursa(job #1856985)
Utilizator | Data | 25 ianuarie 2017 17:57:19 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[110][110],n,i,j,k,oo=1000010;
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
f>>a[i][j];
if(a[i][j]==0)
a[i][j]=oo;
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i!=j)
for(k=1;k<=n;k++)
if(i!=k&&j!=k)
a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<((a[i][j]==oo)?0:a[i][j])<<' ';
g<<'\n';
}
return 0;
}