#include <cstdio>
#include <ctime>
#include <cstdlib>
#include <algorithm>
using std::min;

const int n = 800;
int d[n][n];

int main() {
  clock_t st = clock();
  for (int i = 0; i < n; i++)
  for (int j = 0; j < n; j++)
    d[i][j] = rand();
  printf("%d\n", clock() - st);
  for (int i = 0; i < n; i++)
  for (int j = 0; j < n; j++)
  for (int k = 0; k < n; k++)
    d[j][k] = min(d[j][k], d[j][i] + d[i][k]);
  printf("%d\n", clock() - st);
  return 0;
}