Cod sursa(job #1703866)
| Utilizator | Data | 17 mai 2016 18:37:32 | |
|---|---|---|---|
| Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.93 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream be("royfloyd.in");
ofstream ki("royfloyd.out");
int a[101][101];
int n;
be >> n;
for(int i = 1;i<=n;i++) {
for(int j = 1;j<=n;j++) {
be >> 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][j]==0) {
if(i !=j) {
a[i][j] = a[i][k] + a[k][j];
}
}
else {
if(a[i][j]>a[i][k] + a[k][j]) {
a[i][j] = a[i][k] + a[k][j] ;
}
}
}
}
}
for(int i = 1;i<=n;i++) {
for(int j = 1;j<=n;j++) {
ki << a[i][j] << " " ;
}
ki << endl;
}
return 0;
}
