Cod sursa(job #1217117)
| Utilizator | Data | 6 august 2014 16:52:24 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include<fstream>
#define MAXN 101
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
int N,C[MAXN][MAXN];
int main() {
int i,j,k;
cin>>N;
for(i=1;i<=N;i++)
for(j=1;j<=N;j++)
cin>>C[i][j];
for(k=1;k<=N;k++)
for(i=1;i<=N;i++)
for(j=1;j<=N;j++)
if(C[i][k] && C[k][j] && (C[i][j]>C[i][k]+C[k][j] || !C[i][j]) && i!=j)
C[i][j]=C[i][k]+C[k][j];
for(i=1;i<=N;i++) {
for(j=1;j<=N;j++)
cout<<C[i][j]<<" ";
cout<<"\n"; }
return 0;
}
