Pagini recente » Arb4 | Borderou de evaluare (job #3207467) | Cod sursa (job #685450) | Borderou de evaluare (job #562325) | Cod sursa (job #2855107)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
const int MAXN = 103;
int n, a[MAXN][MAXN];
int main()
{
fin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
fin >> 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++, fout << "\n")
for(int j = 1; j <= n; j++)
fout << a[i][j] << " ";
return 0;
}