Pagini recente » Cod sursa (job #980917) | Cod sursa (job #1876853) | Cod sursa (job #2976984) | Cod sursa (job #546824) | Cod sursa (job #2812168)
#include <iostream>
#include <fstream>
#define MAX (1 << 30)-1
using namespace std;
int n, c[105][105];
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
void citire(){
fin >> n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j){
fin >> c[i][j];
if(!c[i][j] && i != j)
c[i][j] = MAX;
}
}
void rezolvare(){
for(int k = 1; k <=n ; ++k){
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
c[i][j] = min (c[i][j],c[i][k]+c[k][j]);
}
}
void afisare(){
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j)
fout << c[i][j] << ' ';
fout << '\n';
}
}
int main()
{
citire();
rezolvare();
afisare();
return 0;
}