Cod sursa(job #1107836)
Utilizator | ANDREI POP vasand | Data | 14 februarie 2014 14:16:21 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
# include <iostream>
# include <fstream>
# define nmax 100
using namespace std;
int a[nmax][nmax], n, m;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int main()
{
f>>n;
int i,x,y,c,k,j;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
f>>a[i][j];
for(k=1; k<=n; k++)
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
if(a[i][j]> a[i][k]+a[k][j] && i!=j && i!=k)
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]<<" ";
g<<'\n';
}
return 0;
}