Pagini recente » fmi-no-stress-9-warmup/solutii | Cod sursa (job #3208051) | Cod sursa (job #1728554) | Cod sursa (job #306052) | Cod sursa (job #2686095)
#include <bits/stdc++.h>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
const int INF = 1000000;
int dist[105][105],n;
int main()
{
in>>n;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
{
in>>dist[i][j];
if(dist[i][j] == 0 && i!=j)
dist[i][j] = INF;
}
for(int k=0;k<n;k++)
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
if(dist[i][k]+dist[k][j]<dist[i][j])
dist[i][j] = dist[i][k] + dist[k][j];
for(int i=0;i<n;i++){
for(int j=0;j<n;j++)
if(dist[i][j]==INF)
out<<"0 ";
else
out<<dist[i][j]<<' ';
out<<'\n';
}
return 0;
}