Cod sursa(job #662385)
Utilizator | Oriana oriana | Data | 16 ianuarie 2012 17:17:30 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
int a[100][100],i,j,k,n;
int main ()
{f>>n;
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][k]+a[k][j]<a[i][j]&&a[i][k]!=0&&a[k][j]!=0)
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';}}