Pagini recente » Cod sursa (job #2423609) | Cod sursa (job #1513256) | Cod sursa (job #2427362) | Cod sursa (job #1838930) | Cod sursa (job #2423453)
//#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 i = 1; i <= N; i++)
// for (int j = 0; j <= N; j++)
// dist[i][j] = INT_MAX;
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] = 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;
}