Cod sursa(job #2128916)
| Utilizator | Data | 12 februarie 2018 11:40:32 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include<fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[500][500],n,i,j,k;
int main()
{
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
for(int k = 1 ; k <=n; k++)
{
for(int i = 1; i<=n;i++)
{
for(int j = 1 ; j <=n; j++)
{
if(a[i][k] != 0 && a[k][j] != 0 && (a[i][j] > a[i][k] + a[k][j] || a[i][j] == 0) && i != j)
a[i][j] = a[i][k] + a[k][j];
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<"\n";
}
}
