mistidoi

"use strict";

// note: this solution requires Babel, as node doesn't yet support tail call optimization.

let firstColumn = function firstColumn(y, acc = 1) {
    if (y == 1) {
        return acc;
    }
    return firstColumn(y - 1, acc + (y - 1));
};

mistidoi

import System.Environment
import Data.List.Split
import Data.List.Utils
import Data.List

-- usage: $ ./bcp2csv input.txt output.txt
main :: IO ()
main = do
  args <- getArgs
  input <- readFile $ head args

mistidoi

import System.Environment
import Data.List.Split
import Data.List.Utils
import Data.List
import qualified Data.ByteString.Lazy.Search as S
import qualified Data.ByteString.Lazy.Char8 as C

-- usage: $ ./bcp2csv input.bcp output.csv
main :: IO ()
main = do

mistidoi

import Data.List

main = do
    let input = [33,14,18,20,45,35,16,35,1,13,18,13,50,44,48,6,24,41,30,42]
    let total = 150
    let combinations_summing_to_total = [x | x <- powerSet input, sum x == total]
    putStrLn "Solution to part 1:"
    print $ length $ combinations_summing_to_total

    let minimum_number_of_cups = minimum $ map length combinations_summing_to_total

mistidoi

"use strict";


let fs = require('fs');
let _ = require("lodash");


class Or {
    constructor(arg1, arg2) {
        this.arg1 = arg1;