Pagini recente » Cod sursa (job #2490820) | Cod sursa (job #246355) | Cod sursa (job #2976274) | Cod sursa (job #216268) | Cod sursa (job #2573268)
#include <bits/stdc++.h>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int n;
int m[105][105];
int main()
{
f >> n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
f >> m[i][j];
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][k] + m[k][j] || m[i][j] == 0) && 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)
g << m[i][j] << " \n"[j == n];
return 0;
}