Cod sursa(job #2301559)
| Utilizator | Data | 13 decembrie 2018 09:48:05 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n,i,j,k,a[105][105];
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++)
if(a[i][k]!=0 && a[k][j]!=0 && i!=j && (a[i][j]>a[i][k]+a[k][j]|| a[i][j]==0))
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";
}
return 0;
}
