Cod sursa(job #2605038)
| Utilizator | Data | 24 aprilie 2020 12:23:20 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int a[105][105], n;
int main()
{
in>>n;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
in>>a[i][j];
}
}
for(int k=1;k<=n;k++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(a[i][k]!=0 && a[k][j]!=0 && (a[i][j]>a[i][k]+a[k][j] || !a[i][j]) && i!=j){
a[i][j]=a[i][k]+a[k][j];
}
}
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
out<<a[i][j]<<" ";
}
out<<endl;
}
}
