Pagini recente » Cod sursa (job #287696) | Cod sursa (job #61096) | Cod sursa (job #718296) | Cod sursa (job #140810) | Cod sursa (job #2603311)
#include <iostream>
#include <fstream>
using namespace std;
int a[101][101], n, i, j, k;
void Roy_Floyd()
{
for(k = 1; k <= n; ++ k)
{
for(i = 1; i <= n; ++ i)
{
for(j = 1; j <= n; ++ j)
{
if( i != j && a[i][k] != 0 && a[k][j] != 0 && ( a[i][j] > a[i][k] + a[k][j] || a[i][j] == 0 ) )
a[i][j] = a[i][k] + a[k][j];
}
}
}
}
int main()
{
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");
f >> n;
for(i = 1; i <= n; ++ i)
{
for(j = 1; j <= n; ++ j)
{
f >> a[i][j];
}
}
Roy_Floyd();
for(i = 1; i <= n; ++ i)
{
for(j = 1; j <= n; ++ j)
{
g << a[i][j] << " ";
}
g << '\n';
}
return 0;
}