Pagini recente » Cod sursa (job #799921) | oni-2013-11-12 | Borderou de evaluare (job #2014743) | Cod sursa (job #2710603) | Cod sursa (job #3253110)
#include <fstream>
using namespace std;
ifstream cin("royfloyd.in");
ofstream cout("royfloyd.out");
const int Nmax = 101;
int a[Nmax][Nmax], n, d[Nmax][Nmax];
void roy()
{
for(int k=1; k<=3; k++)
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
a[i][j] = min(a[i][j], a[i][k] + a[k][j]);
}
int main()
{
cin >> n;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
cin >> a[i][j];
for(int i=1; i<=n; i++,cout << '\n')
for(int j=1; j<=n; j++)
cout << a[i][j] << " ";
return 0;
}