Pagini recente » Cod sursa (job #1258216) | Cod sursa (job #2803025) | Cod sursa (job #170179) | Istoria paginii runda/simulare-40-2 | Cod sursa (job #2909920)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream reader("royfloyd.in");
ofstream writer("royfloyd.out");
int n;
reader>>n;
int a[n][n];
for(int i=0;i<n;++i)
for(int j=0;j<n;++j)
reader>>a[i][j];
for(int i=0;i<n;++i)
for(int j=0;j<n;++j)
for(int h=0;h<n;++h)
if(a[j][i]+a[i][h]<a[j][h] and a[j][i] and a[i][h] and a[j][h])
a[j][h]=a[j][i]+a[i][h];
for(int i=0;i<n;++i)
{
for(int j=0;j<n;++j)
writer<<a[i][j]<<" ";
writer<<'\n';
}
return 0;
}