Pagini recente » Cod sursa (job #1248221) | Cod sursa (job #3337107) | Cod sursa (job #627371) | Cod sursa (job #3352456) | Cod sursa (job #3302956)
#include <iostream>
#include <algorithm>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
#define INF 1e9
int main() {
ios_base::sync_with_stdio(false);
f.tie(nullptr);
g.tie(nullptr);
int n;
f >> n;
int c[n+1][n+1], d[n+1][n+1];
for( int i = 1; i <= n; i++ )
{
for( int j = 1; j <= n; j++ )
{
f >> c[i][j];
d[i][j] = c[i][j];
}
}
for( int k = 1; k <= n; k++ )
{
for( int i = 1; i <= n; i++ )
{
for( int j = 1; j <= n; j++ )
{
d[i][j] = min( d[i][j], d[i][k] + d[k][j] );
}
}
}
for( int i = 1; i <= n; i++ )
{
for( int j = 1; j <= n; j++ )
{
g << d[i][j] << " ";
}
g << "\n";
}
return 0;
}