gistfile1.txt

int rec(int n, int cnt) {
  if (cnt == 0) {
    return n == 0 ? 1 : 0;
  }
  int ret = dp[cnt][n];
  if (ret == -1) {
    ret = 0;
    for (int p : primes) {
      if (p <= n) {
        ret += rec(n - p, cnt - 1);
      } else {
        break;
      }
    }

    dp[cnt][n] = ret;
  }
  return ret;
}


main() {
  ...
  int ret = rec(n, 4);
  ...
}