Pagini recente » Cod sursa (job #869719) | Istoria paginii utilizator/eduardbigioi | Cod sursa (job #2017338) | Cod sursa (job #261930) | Cod sursa (job #1850144)
#include <cstdio>
using namespace std;
FILE *f, *g;
int n;
int a[101][101];
void readFile()
{
f = fopen("royfloyd.in", "r");
int i, j;
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()
{
int i, j, k;
for(i = 1; i <= n; i ++)
{
for(j = 1; j <= n; j ++)
{
for(k = 1; k <= n; k ++)
{
if(i != j)
{
if(a[i][k] > 0 && a[k][j] > 0)
{
if(a[i][j] == 0 || a[i][j] > a[i][k] + a[k][j])
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
}
}
void printFile()
{
g = fopen("royfloyd.out", "w");
int i, j;
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()
{
readFile();
solve();
printFile();
return 0;
}