Pagini recente » Cod sursa (job #1274915) | Cod sursa (job #1866110) | Cod sursa (job #1871652) | Cod sursa (job #490291) | Cod sursa (job #2815460)
#include <iostream>
#include <fstream>
#include <climits>
#define MAX INT_MAX/2
using namespace std;
ifstream f ("royfloyd.in");
ofstream g ("royfloyd.out");
int n, costuri[101][101];
int main()
{
f >> n;
for(int i = 1; i<=n; i++)
{
for(int j = 1; j<=n; j++)
{
f >> costuri[i][j];
if(i!=j && costuri[i][j]==0)
costuri[i][j] = MAX;
}
}
for(int k = 1; k<=n; k++)
for(int i = 1; i<=n; i++)
for(int j = 1; j<=n; j++)
if(costuri[i][j]>costuri[i][k]+costuri[k][j])
costuri[i][j] = costuri[i][k]+costuri[k][j];
for(int i = 1;i<=n;i++)
{
for(int j = 1; j<=n; j++)
g << costuri[i][j]<< " ";
g << endl;
}
}