Pagini recente » Cod sursa (job #1851352) | Cod sursa (job #3214538) | Cod sursa (job #3163931) | Cod sursa (job #2867502) | Cod sursa (job #3251454)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int MAXN = 100;
int N;
int G[MAXN + 1][MAXN + 1];
int main()
{
fin >> N;
for (int i = 1; i <= N; i++)
for (int j = 1; j <= N; j++)
fin >> G[i][j];
for (int i = 1; i <= N; i++)
for (int j = 1; j <= N; j++)
for (int k = 1; k <= N; k++)
G[i][j] = min(G[i][j], G[i][k] + G[k][j]);
for (int i = 1; i <= N; i++)
{
for (int j = 1; j <= N; j++)
fout << G[i][j] << ' ';
fout << endl;
}
return 0;
}