Pagini recente » Cod sursa (job #2068529) | Cod sursa (job #2757785) | Cod sursa (job #2557196) | Cod sursa (job #1085067) | Cod sursa (job #2862512)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("royfloyd.in");
ofstream fout ("royfloyd.out");
int n,m[105][105],dist[105][105];
int main()
{
fin >> n;
for(int i=0;i<n;++i)
{
for(int j=0;j<n;++j)
{
fin >> m[i][j];
if (m[i][j] == 0 && i != j)
m[i][j] = 1e9;
dist[i][j] = m[i][j];
}
}
for(int k=0;k<n;++k)
{
for(int i=0;i<n;++i)
{
for(int j=0;j<n;++j)
{
dist[i][j] = min(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]==1e9)
fout << "0 ";
fout << dist[i][j] << " ";
}
fout << '\n';
}
return 0;
}