Cod sursa(job #1849231)
| Utilizator | Data | 17 ianuarie 2017 10:26:36 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
#define MAX 999999999
using namespace std;
long i,j,n,v[101][101],k;
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
f>>v[i][j];
if(v[i][j]==0 && i!=j)
v[i][j]=MAX;
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
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++)
g<<v[i][j]<<" ";
g<<'\n';
}
return 0;
}
