Cod sursa(job #2017815)
Utilizator | Savu Ioan-Daniel Johnny07 | Data | 2 septembrie 2017 17:53:39 |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[101][101],b[101][101],i,j,n,k;
int main()
{
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++)
a[i][k]=min(a[i][k], a[i][j]+a[j][k]);
}
}
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++) g<<a[i][j]<<" ";
g<<"\n";
}
return 0;
}