Cod sursa(job #1920685)
| Utilizator | Data | 10 martie 2017 09:17:14 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream f("roy.in");
ofstream g("roy.out");
int i,j,x,y,c,m,n,a[101][101];
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(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] || !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';
}
}
