Cod sursa(job #2173091)
| Utilizator | Data | 15 martie 2018 20:29:17 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[102][102]={0},n;
void citire()
{int i,j;
fin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
fin>>a[i][j];
}
void afisare()
{
int i,j;
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
fout<<a[i][j]<<' ';
fout<<endl;
}
}
int main()
{
int i,j,k;
citire();
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])
a[i][j]=a[i][k]+a[k][j];
afisare();
}
