Pagini recente » Cod sursa (job #279339) | Cod sursa (job #1834212) | Cod sursa (job #2443902) | Cod sursa (job #1327438) | Cod sursa (job #2682400)
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int nmax = 1e2 + 1;
int n, rin[nmax][nmax];
int main()
{
f >> n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
f >> rin[i][j];
for(int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
rin[i][j] = min(rin[i][k] + rin[k][j], rin[i][j]);
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
g<<rin[i][j]<<' ';
g<<'\n';
}
return 0;
}