Pagini recente » Cod sursa (job #3212546) | Cod sursa (job #2590320) | Cod sursa (job #1789444) | Cod sursa (job #2834332) | Cod sursa (job #2722831)
#include <fstream>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");
int n;
int cost[101][101];
int main()
{
in>>n;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
in>>cost[i][j];
for(int k = 1; k <= n; ++k)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= n; ++j)
if(i != j && cost[i][k] != 0 && cost[k][j] != 0 && cost[i][j] >= cost[i][k] + cost[k][j])
cost[i][j] = cost[i][k] + cost[k][j];
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= n; ++j)
out<<cost[i][j]<<' ';
out<<'\n';
}
in.close();
out.close();
return 0;
}