Cod sursa(job #1484691)
| Utilizator | Data | 11 septembrie 2015 17:38:03 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int i, j, k, C[100][100],n;
void roy_floyd ()
{
for (k=1;k<=n;k++)
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if (C[i][k]!=0 && C[k][j]!=0 && i!=j)
if (C[i][j]>C[i][k]+C[k][j] || C[i][j]==0)
{
C[i][j] = C[i][k]+C[k][j];
}
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)f>>C[i][j];
roy_floyd();
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)g<<C[i][j]<<" "; g<<endl;}
f.close();
g.close();
}
