md2perpe

module Main where

fac_ :: Integer -> Integer -> Integer
fac_ 0 p = p
fac_ n p = fac_ (n-1) (n*p)

fac :: Integer -> Integer
fac n = fac_ n 1

main = do

md2perpe

import itertools
from typing import Iterator

def sift(ns: Iterator[int]) -> Iterator[int]:
    p = next(ns)
    yield p
    yield from sift(filter(lambda n: n%p != 0, ns))

def primes():
    yield from sift(itertools.count(2))

md2perpe

BIG = 1_000_000.0
SMALL = 1e-12
COUNT = 1_000_000


def big_first():
    yield BIG
    for _ in range(COUNT):
        yield SMALL

md2perpe

node_modules/
main.js
package-lock.json

md2perpe

words = ['peace','piece','geese','tease','spoon']

def ham_dis(word1, word2):
    return sum(c1 != c2 for c1, c2 in zip(word1, word2))

output = [
    [ 'Ham-Dis', *words ],
    *(
        [ w1, *(ham_dis(w1, w2) for w2 in words) ]
            for w1 in words

md2perpe

'  ** PYTHON CODE CHALLENGE - SCHOOL ADMISSIONS ** '
# write code to handle admissions for a school - print results
# rules: pass test and interview. If applicant is legacy
# passing either test or interview is enough to be admitted 
# your output should be sorted
# output = 'Accepted students: An, Bo, Mo, My, Xi'


appl =['Jay','Sam','Vi','Li','My','Xi','On','Mo','An','Bo']
test_ok =['xi','my','sam','an','mo','on']

md2perpe

#include <stdio.h>

typedef int square;
typedef int row;
typedef int col;

int is_valid_row(row n)
{
    return (
        n == 0b0011 ||

md2perpe

t :: Integer -> Float
t 0 = 0
t n = sqrt(2 + t(n-1))

p :: Integer -> Float
p n = 2**(n+1) * sqrt(2 - t(n))

md2perpe

interface Thenable<a> {
    then<b>(cont: (_: a) => Thenable<b>): Thenable<b>;
}

/*
run_slow_task.then((result) => {
    do_something(result).then((new_result) => {
        do_something_else(new_result)
    })
})

md2perpe

import itertools

def primes():

    def sieve(numbers):
        try:
            n = next(numbers)
            yield n
            yield from sieve(filter(lambda m: m%n!=0, numbers))
        except StopIteration: