rhodes: Look up the redundant workers using the correct query.

[rhodes] / factor.c

#include <assert.h>
#include <stdarg.h>
#include <stdlib.h>
#include <stdio.h>

#include <pari/pari.h>

static const char *prog;

__attribute__((noreturn))
static void barf(const char *msg, ...)
{
  va_list ap;

  va_start(ap, msg);
  fprintf(stderr, "%s: ", prog);
  vfprintf(stderr, msg, ap);
  fputc('\n', stderr);
  va_end(ap);
  exit(2);
}

int main(int argc, char *argv[])
{
  GEN n, ff, pp, ee;
  long nf;

  prog = argv[0];
  if (argc != 2) { fprintf(stderr, "usage: %s N\n", prog); exit(2); }
  pari_init(16ul*1024ul*1024ul, 0);
  n = gp_read_str(argv[1]);
  if (typ(n) != t_INT || signe(n) <= 0) barf("expected a positive integer");
  sd_factor_proven("1", d_SILENT);
  ff = Z_factor(n);
  assert(typ(ff) == t_MAT);
  assert(lg(ff) == 3);
  pp = gel(ff, 1); ee = gel(ff, 2);
  assert(typ(pp) == t_COL);
  assert(typ(ee) == t_COL);
  nf = lg(pp); assert(nf == lg(ee));
  nf--;
  while (nf--) {
    pp++; ee++;
    pari_printf("%Ps %Ps\n", *pp, *ee);
  }
  return (0);
}