Mai intai trebuie sa te autentifici.
Cod sursa(job #2124238)
| Utilizator | Data | 7 februarie 2018 01:03:10 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.74 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n, a[105][105];
void citire()
{
int i, j;
fin>>n;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
fin>>a[i][j];
fin.close();
}
void royfloid()
{
int i, j, k;
for(k=1; k<=n; k++)
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
if(i!=j && (a[i][j]==0 || a[i][j]>a[i][k]+a[k][j]) && a[i][k] && a[k][j])
a[i][j]=a[i][k]+a[k][j];
}
void afisare()
{
int i, j;
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
fout<<a[i][j]<<' ';
fout<<'\n';
}
fout.close();
}
int main()
{
citire();
royfloid();
afisare();
return 0;
}
