Cod sursa(job #468782)
Utilizator | Data | 5 iulie 2010 00:10:38 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int C[101][101];
int N,i,j,k;
int main()
{
in>>N;
for(i=1;i<=N;i++)
for(j=1;j<=N;j++)
in>>C[i][j],C[i][j]=(C[i][j]==0?9999:C[i][j]);
for(k=1;k<=N;k++)
for(i=1;i<=N;i++)
if(i!=k)for(j=1;j<=N;j++)
if(C[i][j]>C[i][k]+C[k][j]&&i!=j)
C[i][j]=C[i][k]+C[k][j];
for(i=1;i<=N;i++)
{
for(j=1;j<=N;j++)
out<<(C[i][j]==9999?0:C[i][j])<<' ';
out<<'\n';
}
return 0;
}