Pagini recente » Rating Shaorma e buna (nutealesu) | Cod sursa (job #675863) | Cod sursa (job #1706506) | Cod sursa (job #680222) | Cod sursa (job #2198442)
//#include <stdio.h>
#include <fstream>
using namespace std;
int n, a[105][105];
void read_input()
{
ifstream fin("royfloyd.in");
fin >> n;
int x;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
fin >> x;
a[i][j] = x;
}
}
fin.close();
}
void roy_floyd()
{
int i, j, k;
for (k = 1; k <= n; k++)
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (a[i][k] && a[k][j] &&
(a[i][j] > a[i][k] + a[k][j] || !a[i][j]) &&
i != j) {
a[i][j] = a[i][k] + a[k][j];
}
}
void print_output()
{
ofstream fout("royfloyd.out");
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++) {
fout << a[i][j] << ' ';
}
fout << '\n';
}
fout.close();
}
int main()
{
read_input();
roy_floyd();
print_output();
return 0;
}