Mai intai trebuie sa te autentifici.
Cod sursa(job #1667779)
| Utilizator | Data | 29 martie 2016 11:05:25 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,A[105][105];
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
void citire(){
for(int i=0; i<n; i++)
for(int j=0; j<n; j++)
A[i][j]=0;
for(int i=0; i<n; i++)
for(int j=0; j<n; j++)
fin>>A[i][j];
}
void scriere(){
for(int i=0; i<n; i++){
for(int j=0; j<n; j++)
fout<<A[i][j]<<" ";
fout<<endl;
}
}
void RW(){
int i,j,k;
for(k=0; k<n; k++)
for(i=0; i<n; i++)
for(j=0; j<n; j++)
if (A[i][k]&&A[k][j]&&(A[i][j]>A[i][k]+A[k][j] || !A[i][j])) A[i][j]=A[i][k]+A[k][j];
}
int main()
{ fin>>n;
citire();
RW();
scriere();
return 0;
}
