Mai intai trebuie sa te autentifici.
Cod sursa(job #1614882)
| Utilizator | Data | 26 februarie 2016 11:31:29 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int N,a[105][105];
void citire()
{
fin>>N;
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
fin>>a[i][j];
}
void roy()
{
for(int k=1;k<=N;k++)
for(int i=1;i<=N;i++)
if(a[i][k])
for(int j=1;j<=N;j++)
if(a[k][j] && i!=j && (a[i][j]>a[i][k]+a[k][j] || !a[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++)
fout<<a[i][j]<<' ';
fout<<'\n';
}
}
int main()
{
citire();
roy();
afisare();
return 0;
}
