vladris

// Game of Life cell matrix wrapped in an object
type Matrix = { 
    m: boolean[][]
    wrap: boolean;
};

// Makes matrix of desired width x height plus an initial configuration of "on" cells and wrap-around flag
function makeMatrix(width: number, height: number, initialConfig: [number, number][], wrap: boolean) {
    let m = new Array<boolean[]>(height);

vladris

MIN_MERGE = 32
MIN_GALLOP = 7

minGallop = MIN_GALLOP

def minRunLength(n):
    r = 0
    while n >= MIN_MERGE:
        r |= n & 1
        n >>= 1

vladris

vladris

vladris

git log --diff-filter=D --name-only --pretty="format:" > ..\FILES

for /f "tokens=*" %%a in (..\FILES) do (
    git filter-branch --tag-name-filter cat --index-filter "git rm -r --cached --ignore-unmatch %%a" --prune-empty -f -- --all
)

vladris

#include <array>
#include <fstream>
#include <iostream>

using namespace std;

const size_t memory_size = 1024;

template <typename It>
It& skip(It&& it, char from, char to) {

vladris

#include <type_traits>

// Natural numbers
struct nat { };

// Typed only if T is derived from nat
template <typename T>
using nat_only = std::enable_if_t<std::is_base_of<nat, T>::value>;

// Zero is a natural number

vladris

// Since generics in Java are removed at compile-time, we cannot overload methods
// based on generic types

// Below class does not compile:
// Erasure of method Foo(T1) is the same as another method in type Test<T1,T2>
// Erasure of method Foo(T2) is the same as another method in type Test<T1,T2>
class Generic<T1, T2> {
    void Foo(T1 arg) {
    }
	

vladris

class Graph:
    def __init__(self, nodes=dict(), edges=[]):
        self.nodes = nodes
        self.edges = edges
        self.colors = len(set(nodes.values()))

    def connected(self, node):
        for edge in self.edges:
            if edge[0] == node:
                yield edge[1]

vladris

components = [tuple(map(int, line.strip().split('/'))) for line in open("input.txt").readlines()]

def best_bridge(end, components):
    result = 0
    for i, c in enumerate(components):
        if end == c[0]:
            new_end = c[1]
        elif end == c[1]:
            new_end = c[0]
        else: