!752
!_case

// an example
static class E {
  S in, out;
}

static L<E> examples = group(E.class, litlist("in", "out"), litlist(
  "0", "00",
  "1", "11",
  "5", "55",
  "a", "aa",
  "b", "bb"));
  
p {
  print(structure(examples));
  
  for (int i = 0; i < l(examples); i++)
    computeExample(i);
}

static O solver;

static void computeExample(int pivot) {
  if (solver == null)
    solver = hotwire("#738");
  
  // move pivot example last so it's used as secret example internally
  S[] list = new S[l(examples)*2];
  int j = 0;
  for (int i = 0; i < l(examples); i++)
    if (i != pivot) {
      list[j++] = examples.get(i).in;
      list[j++] = examples.get(i).out;
    }
  list[j++] = examples.get(pivot).in;
  list[j++] = examples.get(pivot).out;
  O case = call(solver, "quickSolve", (O) list);
  
  if (get(case, "winner") != null)
    print("Example " + (pivot+1) + " computable.");
  else
    print("Example " + (pivot+1) + " not computable.");
}