Cod sursa(job #1514903)
| Utilizator | Data | 31 octombrie 2015 19:39:11 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.74 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n, v[102][102];
int main()
{
int i, n, j, k;
ifstream g ("royfloyd.in");
ofstream h ("royfloyd.out");
g>>n;
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
g>>v[i][j];
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=0;j<=n;j++)
{
if (v[i][k] && v[k][j])
if(i!=j)
if (v[i][j] > v[i][k] + v[k][j] || !v[i][j])
v[i][j] = v[i][k] + v[k][j];
}
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
h<<v[i][j]<<" ";
h<<"\n";
}
g.close();
h.close();
return 0;
}
