Cod sursa(job #1134264)
| Utilizator | Data | 6 martie 2014 12:09:57 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream d("royfloyd.in");
ofstream o("royfloyd.out");
int a[101][101],n;
void rf()
{
int j,i,k;
for (k=1; k<=n; k++)
for(i=1; i<=n; i++)
if (i!=k)
for (j=1; j<=n; j++)
if (j!=i && j!=k && a[i][j]>a[i][k]+a[k][j])
a[i][j]=a[i][k]+a[k][j];
}
int main()
{
int i,j;
d>>n;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
d>>a[i][j];
rf();
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
o<<a[i][j]<<' ';
o<<'\n';
}
return 0;
}
