Pagini recente » Cod sursa (job #2585448) | Cod sursa (job #1181872) | Cod sursa (job #1772965) | Cod sursa (job #1405386) | Cod sursa (job #2100941)
#include <fstream>
using namespace std;
ifstream F("royfloyd.in");
ofstream G("royfloyd.out");
int n, a[105][105];
int main()
{
F >> n;
for(int i = 1; i <= n; ++ i)
for(int j = 1; j <= n; ++ j)
F >> a[i][j];
for(int k = 1; k <= n; ++ k)
for(int i = 1; i <= n; ++ i)
for(int j = 1; j <= n; ++ j)
if(a[i][k] && a[k][j] && i != j && (a[i][j] > a[i][k]+a[k][j] || !a[i][j]))
a[i][j] = a[i][k]+a[k][j];
for(int i = 1; i <= n; ++ i, G << '\n')
for(int j = 1; j <= n; ++ j)
G << a[i][j] << " ";
return 0;
}