Cod sursa(job #1830114)
| Utilizator | Data | 16 decembrie 2016 10:42:59 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.74 kb |
#include<iostream>
#include<fstream>
#define MAX 101
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int a[MAX][MAX];
int main()
{
int i,j,k,n;
fin>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
fin>>a[i][j];
}
}
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';
}
fin.close();
fout.close();
return 0;
}
