Pagini recente » Cod sursa (job #775385) | Cod sursa (job #2101534) | Cod sursa (job #550968) | Cod sursa (job #551652) | Cod sursa (job #2388138)
#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) 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] && t[k][j])
if((t[i][j] > t[i][k] + t[k][j]) || i != j && !t[i][j]) t[i][j] = t[i][k] + t[k][j];
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j) fout << t[i][j] << " ";
fout << "\n";
}
return 0;
}