Cod sursa(job #1023507)
| Utilizator | Data | 7 noiembrie 2013 08:32:32 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int A[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++)
if(i!=j&&(A[i][k]+A[k][j]<A[i][j])&&A[i][k]*A[k][j]||A[i][j]==0)
A[i][j]=A[i][k]+A[k][j];
k=1;
while(k<=n)
{
A[k][k]=0;
k++;
}
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
g<<A[i][j]<<' ';
g<<'\n';}
return 0;
}
