Cod sursa(job #1359009)
Utilizator | Data | 24 februarie 2015 20:55:06 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int mx[100][100],i,j,k,n;
void rwf()
{
f>>n;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
f>>mx[i][j];
for(k=1; k<=n; k++)
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
if(mx[i][j]>mx[i][k]+mx[k][j])
mx[i][j]=mx[i][k]+mx[k][j];
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
g << mx[i][j] << ' ';
g << '\n';
}
}
int main()
{
rwf();
return 0;
}