Pagini recente » Borderou de evaluare (job #1034921) | Cod sursa (job #2149481) | Cod sursa (job #613677) | Cod sursa (job #2631189) | Cod sursa (job #2575105)
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n, m, a[101][101];
int main()
{
in >> n;
for(int i = 1;i <= n;i++)
for(int j = 1;j <= n;j++)
in >> 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++)
{
for(int j = 1;j <= n;j++)
out << a[i][j] << " ";
out << '\n';
}
return 0;
}