timothy-shields

from functools import lru_cache
def make_E(U):
    @lru_cache(maxsize=None)
    def memoized_E(z, t):
        if z < t:
            return (1.0 / 6.0) * (U(0) + sum(E(z + i, t) for i in [1, 2, 3, 4, 5]))
        else:
            return U(z)
    def E(z, t):
        return memoized_E(z, max(z, t))

timothy-shields

{
  "locked": false,
  "version": 1,
  "targets": {
    "DNX,Version=v4.5.1": {
      "Ix-Main/1.2.3": {
        "type": "package",
        "frameworkAssemblies": [
          "System",
          "System.Core"

timothy-shields

            int n = 11;
            SortedSet<int> F = new SortedSet<int>();
            while (true)
            {
                if (!F.Any() || F.Min > n)
                {
                    F.Add(n);
                    n *= 11;
                }
                else

timothy-shields

#include <linqcpp/linq/Enumerable.h>

#include <string>
#include <functional>
#include <iostream>
#include <fstream>

using namespace std;
using namespace linq;