Pagini recente » Cod sursa (job #1455569) | Cod sursa (job #1682924) | Cod sursa (job #2299019) | Cod sursa (job #2123162) | Cod sursa (job #2160280)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int NMax=10001;
int n;
int a[NMax][NMax];
void read()
{
f >> n;
for (int i= 1; i<= n; ++i)
for (int j= 1; j<= n; ++j)
f >> a[i][j];
}
void work()
{
for (int k= 1; k<= n; ++k)
for (int i= 1; i<= n; ++i)
for (int j= 1; j<= n; ++j)
if ( a[i][k]+a[k][j] < a[i][j])
a[i][j]= a[i][k] + a[k][j];
}
void print()
{
for (int i= 1; i<= n; ++i)
{
for (int j= 1; j<= n; ++j)
g << a[i][j] << " ";
g << endl;
}
}
int main()
{
read();
work();
print();
}