Pagini recente » Cod sursa (job #555867) | Cod sursa (job #1194383) | Cod sursa (job #588771) | Cod sursa (job #916410) | Cod sursa (job #2423402)
#include <iostream>
#include<fstream>
#include<vector>
using namespace std;
int d[101][101];
int t[101][101];
int N;
int main()
{
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
fin >> N;
for (int i = 1; i <= N; i++)
for (int j = 1; j <= N; j++)
fin >> d[i][j];
/*for (int i = 1; i <= N; i++)
for (int j = 1; j <= N; j++)
if (i == j) t[i][j] = 0;
else t[i][j] = i;*/
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])
d[i][j] = d[i][k] + d[k][j];
for (int i = 1; i <= N; i++)
{
for (int j = 1; j <= N; j++)
fout << d[i][j] << " ";
fout << endl;
}
system("pause");
}