Pagini recente » Cod sursa (job #641980) | Cod sursa (job #2589230) | Cod sursa (job #1038902) | Cod sursa (job #1795401) | Cod sursa (job #368929)
Cod sursa(job #368929)
#include <iostream>
#include <cstdio>
#define NMAX 102
using namespace std;
int a[NMAX][NMAX], i, j, k, n;
void read(void)
{
FILE *f = fopen("royfloyd.in", "r");
fscanf(f, "%d", &n);
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
fscanf(f, "%d", &a[i][j]);
fclose(f);
}
void solve(void)
{
for(k = 1; k <= n; k++)
for(i = 1; i <= n; i++)
for(j = 1; j <= n; j++)
if(i != j && a[i][k] && a[k][j])
if(!a[i][j] || a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
}
void print(void)
{
FILE *g = fopen("royfloyd.out", "w");
for(i = 1; i <= n; i++)
{
for(j = 1; j <= n; j++)
fprintf(g, "%d ", a[i][j]);
fprintf(g, "\n");
}
fclose(g);
}
int main(void)
{
read();
solve();
print();
return 0;
}