Cod sursa(job #2296468)
| Utilizator | Data | 4 decembrie 2018 18:30:52 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#define inf 1001
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,i,j,k,a[110][110];
int main() {
fin>>n;
for (i=1;i<=n;i++) {
for (j=1;j<=n;j++) {
fin>>a[i][j];
if (a[i][j]==0&&i!=j)
a[i][j]=inf;
}
}
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];
for (i=1;i<=n;i++) {
for (j=1;j<=n;j++)
fout<<a[i][j]<<" ";
fout<<"\n";
}
return 0;
}
