Cod sursa(job #1380524)
| Utilizator | Data | 7 martie 2015 23:55:25 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[101][101],n,i,j,k;
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][j]>a[i][k]+a[k][j])
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";
}
f.close();
g.close();
}
