Pagini recente » Cod sursa (job #1598723) | Cod sursa (job #3190416) | Cod sursa (job #408998) | Cod sursa (job #2907663) | Cod sursa (job #2131635)
#include <iostream>
#include <fstream>
#include <vector>
#include <bits/stdc++.h>
#include <algorithm>
std::ifstream in("royfloyd.in");
std::ofstream out("royfloyd.out");
int d[101][101];
int main()
{
int n;
in >> n;
for(int i = 0 ; i < n ; i++)
for(int j = 0 ; j < n ; j++)
in >> d[i][j];
for(int k = 0 ; k < n ; k++)
for(int i = 0 ; i < n ; i++)
for(int j = 0 ; j < n ; j++)
if(d[i][k]!=0 && d[k][j]!=0 && i!= k && j !=k && i!=j)
d[i][j] = std::min(d[i][j],d[i][k]+d[k][j]);
for(int i = 0 ; i < n ;i++)
{
for(int j = 0 ; j < n ; j++)
out<<d[i][j]<<" ";
out<<'\n';
}
return 0;
}