Cod sursa(job #2667410)
| Utilizator | Data | 3 noiembrie 2020 13:58:22 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include<fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[101][101],n;
int main()
{
int i,j,k;
fin>>n;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
{
fin>>a[i][j];
if(i!=j&&a[i][j]==0)
a[i][j]=2010;
}
for(k=1; k<=n; k++)
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
if(a[i][k]+a[k][j]<a[i][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;
}
