Mai intai trebuie sa te autentifici.
Cod sursa(job #836116)
| Utilizator | Data | 16 decembrie 2012 12:04:55 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.79 kb |
#include<cstdio>
#define INF 2147483000
using namespace std;
FILE *fin=fopen("royfloyd.in","r");
FILE *fout=fopen("royfloyd.out","w");
int i,j,k,n,m[105][105];
int main()
{
fscanf(fin,"%d",&n);
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
{
fscanf(fin,"%d",&m[i][j]);
if(!m[i][j] && i!=j) m[i][j]=INF;
}
for(k=1;k<=n;++k)
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
if(m[i][j]>m[i][k]+m[k][j] && i!=j && i!=k && j!=k)
m[i][j]=m[i][k]+m[k][j];
for(i=1;i<=n;++i)
{
for(j=1;j<=n;++j)
if(m[i][j]==INF)
fprintf(fout,"0 ");
else
fprintf(fout,"%d ",m[i][j]);
fprintf(fout,"\n");
}
return 0;
}
