Cod sursa(job #2212555)
| Utilizator | Data | 14 iunie 2018 13:28:53 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,a[101][101];
void citire()
{
f>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
f>>a[i][j];
}
void rf()
{
int j,i,k;
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] && i!=j)
{
a[i][j]=a[i][k]+a[k][j];
}
}
void afisare()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<"\n";
}
}
int main()
{
citire();
rf();
afisare();
}
