Cod sursa(job #2204979)
Utilizator | Luca Perju Verzotti lucaperju | Data | 17 mai 2018 14:43:36 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.74 kb |
#include <fstream>
using namespace std;
ifstream in ("royfloyd.in");
ofstream out ("royfloyd.out");
int v[103][103];
int main()
{
int n,i,j,k;
in>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
in>>v[i][j];
if(v[i][j]==0 && i!=j)
v[i][j]=9999999;
}
for(k=1;k<=n;k++)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(i!=k && i!=j && j!=k)
if(v[i][j]>v[i][k]+v[k][j])
v[i][j]=v[i][k]+v[k][j];
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
out<<v[i][j]<<' ';
out<<'\n';
}
return 0;
}