Pagini recente » Cod sursa (job #742650) | Cod sursa (job #1308356) | Cod sursa (job #669013) | Cod sursa (job #2818437) | Cod sursa (job #1783602)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int inline min(int a, int b)
{
return a > b ? b : a;
}
int main()
{
int n, a[102][102];
f >> n;
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)
a[i][j] = min(a[i][k] + a[k][j], a[i][j]);
for(int i = 1; i <= n; ++i)
{
for(int j = 1; j <= n; ++j)
g << a[i][j] << ' ';
g << '\n';
}
}