Pagini recente » Cod sursa (job #490305) | Cod sursa (job #1714180) | Cod sursa (job #1567028) | Cod sursa (job #1912559) | Cod sursa (job #2489947)
#include <bits/stdc++.h>
#define infinity 1000000000
using namespace std;
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int m[101][101], N;
fin >> N;
for(int i = 1; i <= N; ++i)
for(int j = 1; j <= N; ++j)
{
fin >> m[i][j];
if(i != j && !m[i][j]) m[i][j] = infinity;
}
for(int k = 1; k <= N; ++k)
for(int i = 1; i <= N; ++i)
for(int j = 1; j <= N; ++j)
if(m[i][k] + m[k][j] < m[i][j])
m[i][j] = m[i][k] + m[k][j];
for(int i = 1; i <= N; ++i)
{
for(int j = 1; j <= N; ++j)
if(m[i][j] == infinity)
fout << "0 ";
else
fout << m[i][j] << ' ';
fout << '\n';
}
}