Pagini recente » Cod sursa (job #1939359) | Cod sursa (job #1265683) | Cod sursa (job #1105630) | Cod sursa (job #2051397) | Cod sursa (job #3275482)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int oo = 1e9;
int n;
int m[101][101];
void read() {
fin >> n;
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= n; j ++) {
fin >> m[i][j];
if(i != j && m[i][j] == 0)
m[i][j] = oo;
}
}
void royfloyd() {
for(int temp = 1; temp <= n; temp ++)
for(int src = 1; src <= n; src ++)
for(int dest = 1; dest <= n; dest ++)
m[src][dest] = min(m[src][dest], m[src][temp] + m[temp][dest]);
}
void print() {
for(int i = 1; i <= n; i ++, fout << '\n')
for(int j = 1; j <= n; j ++)
fout << m[i][j] << " ";
}
int main() {
read();
royfloyd();
print();
}