#include <algorithm>
#include <iostream>

const size_t data_size = 1010000;

int main() {
  int data[data_size];
  std::fill(data, data+data_size, 0);
  for (int ii = 200; ii <= 999; ++ ii) {
    for (int jj = 200; jj <= 999; ++ jj)
      for (int kk = 0; kk <= 9999; ++ kk) {
        data[10000+ii*jj-kk] += 1;
      }
  }

  double sum = 0;
  int non_zero = 0;

  int perm[data_size];
  for (size_t ii = 0; ii < data_size; ++ ii) {
    perm[ii] = ii;
    if (data[ii] != 0) {
      ++ non_zero;
      sum += data[ii];
    }
  }
  std::sort(perm, perm+data_size, [&data](int a, int b) { return data[a] < data[b]; } );

  for (int ii = 1; ii <= 10; ++ ii)
    std::cout << data[perm[data_size-ii]] << " at " << perm[data_size-ii]-10000 << std::endl;


  std::cout << "non-zero elements:  " << non_zero << std::endl
            << "average:            " << sum/non_zero << std::endl
            << std::endl;

  return 0;
}