Pagini recente » Cod sursa (job #2828394) | Cod sursa (job #2031476) | Cod sursa (job #2894926) | Cod sursa (job #1919566) | Cod sursa (job #1968924)
#include <fstream>
using namespace std;
ifstream F("royfloyd.in");
ofstream G("royfloyd.out");
int n, c[102][102];
int main()
{
F >> n;
for(int i = 1; i <= n; ++ i)
for(int j = 1; j <= n; ++ j)
F >> c[i][j];
for(int k = 1; k <= n; ++ k)
for(int i = 1; i <= n; ++ i)
for(int j = 1; j <= n; ++ j)
if(i != k && j != k && (c[i][j] > c[i][k] + c[k][j] || !c[i][j]) && i!= j && c[i][k] && c[k][j])
c[i][j] = c[i][k] + c[k][j];
for(int i = 1; i <= n; ++ i, G << '\n')
for(int j = 1; j <= n; ++ j)
G << c[i][j] << " ";
return 0;
}