Pagini recente » Cod sursa (job #2857879) | Cod sursa (job #2328469) | Cod sursa (job #1877747) | Cod sursa (job #2383544) | Cod sursa (job #2037398)
#include <iostream>
#include <fstream>
#define inf 19284398
using namespace std;
int n, M[105][105];
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f >> n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
{
f >> M[i][j];
if(!M[i][j]) M[i][j] = inf;
if(i == j) M[i][j] = 0;
}
for(int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
if(M[i][k] + M[k][j] < M[i][j])
M[i][j] = M[i][k] + M[k][j];
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j)
if(M[i][j] < inf) g << M[i][j] << " ";
g << "\n";}
}