Pagini recente » Cod sursa (job #2718990) | Cod sursa (job #2720573) | Cod sursa (job #2346468) | Cod sursa (job #2717155) | Cod sursa (job #1919632)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int cost[110][110],n;
int main()
{
f >>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
f >> 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(cost[i][j])
cost[i][j]=min(cost[i][j],cost[i][k]+cost[k][j]);
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
g << cost[i][j] << " ";
g << "\n";
}
return 0;
}