Pagini recente » Cod sursa (job #729707) | Cod sursa (job #891513) | Cod sursa (job #599314) | Cod sursa (job #1969162) | Cod sursa (job #2388132)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int t[101][101];
const int inf = 12345678;
int main()
{
int n;
fin >> n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j) t[i][j] = inf;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j) fin >> t[i][j];
for(int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
if(t[i][k] != inf && t[k][j] != inf)
if(t[i][j] > t[i][k] + t[k][j]) t[i][j] = t[i][k] + t[k][j];
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j)
if(t[i][j] == inf) fout << 0 << " ";else fout << t[i][j] << " ";
fout << "\n";
}
return 0;
}