Cod sursa(job #2200550)
| Utilizator | Data | 1 mai 2018 18:52:48 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[1000][1000],N,i,j,k;
int main()
{
ifstream f("royfloyd,in");
ofstream g("royfloyd.out");
f>>N;
for(i=1;i<=N;i++)
for(j=1;j<=N;j++)
f>>a[i][j];
for(k=1;k<=N;k++)
for(i=1;i<=N;i++)
for(j=1;j<=N;j++)
{
if(a[i][k]==0&&a[k][j]==0&&(a[i][j]>a[i][k]+a[k][j] or 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<<endl;
}
}
