Pagini recente » Cod sursa (job #644739) | Cod sursa (job #2822097) | Cod sursa (job #38305) | Clasament preONI 2007, Clasa a 10-a | Cod sursa (job #2815607)
#include <bits/stdc++.h>
using namespace std;
ifstream in ("royfloyd.in");
ofstream out ("royfloyd.out");
#define INF 0x3f3f3f3f
int m[101][101];
int a[101][101];
int n;
void RoyFloyd()
{
int n;
in>>n;
for(int i = 1 ; i <= n ; i++)
{
for(int j = 1 ; j <= n ; j++)
{
in>>m[i][j];
if(m[i][j] != 0)
a[i][j]=m[i][j];
else
a[i][j] = INF;
}
}
for(int k = 1 ; k <= n ; 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]);
for(int i = 1 ; i <= n ; i++)
{
for(int j = 1 ; j <= n ; j++)
{
if(i == j || a[i][j] == INF)
a[i][j] = 0;
out<<a[i][j]<<" ";
}
out<<"\n";
}
}
int main()
{
RoyFloyd();
return 0;
}