Pagini recente » Cod sursa (job #520393) | Cod sursa (job #525367) | Cod sursa (job #2451989) | Cod sursa (job #990722) | Cod sursa (job #2749794)
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int a[101][101], n;
void init() {
for(int i = 1; i <= n; i ++)
for(int j = 1; j <= n; j ++)
if(i != j)
a[i][j] = 1e9;
}
int main() {
f >> n;
init();
int x, y, cost;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
f >> 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] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
for(int i = 1; i <= n; i ++, g << '\n')
for(int j = 1; j <= n; j ++)
if(a[i][j] != 1e9)
g << a[i][j] << " ";
else g << -1 << " ";
}