Pagini recente » Cod sursa (job #2139397) | Cod sursa (job #710698) | Cod sursa (job #507799) | Cod sursa (job #1395708) | Cod sursa (job #2422157)
#include <iostream>
#include <vector>
#include<fstream>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
const int N = 101;
int n;
int D[N][N];
void citire()
{
f >> n;
for(int i=1;i<=n;i++)
for (int j = 1; j <= n; j++)
{
int y;
f >> y;
D[i][j] = y;
}
}
int main()
{
citire();
for(int k=1;k<=n;k++)
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if (D[i][j] > D[i][k] + D[k][j] && i!=j)
{
D[i][j] = D[i][k] + D[k][j];
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
g << D[i][j] << " ";
g << endl;
}
return 0;
}