Pagini recente » Cod sursa (job #2423554) | Cod sursa (job #2398482) | Cod sursa (job #2425682) | Cod sursa (job #2396279) | Cod sursa (job #2423844)
//#include "pch.h"
#include <iostream>
#include<fstream>
#include<climits>
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
int dist[101][101];
int graf[105][105];
int main()
{
int N;
f >> N;
for (int i = 1; i <= N; i++)
for (int j = 1; j <= N; j++)
f >> graf[i][j];
for (int k = 1; k <= N; k++)
for (int i = 1; i <= N; i++)
for (int j = 1; j <= N; j++)
if ((graf[i][k] + graf[k][j] < graf[i][j] || graf[i][j]==0)&& graf[i][k] && graf[k][j] && i!=j)
graf[i][j] = graf[i][k] + graf[k][j];
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++)
g << graf[i][j] << ' ';
g << '\n';
}
f.close();
return 0;
}