ray1729

(ns ring-of-primes
  (:gen-class))

(defn prime?
  [n]
  (and (> n 1)
       (not-any? #(zero? (mod n %)) (range 2 (inc (int (Math/sqrt n)))))))

(defn neighbours
  [xs ring]

ray1729

# cms - simple CMS
#
# The simple-cms server is a Compojure application serving content for cms.1729.org.uk

description     "CMS server"

start on filesystem or runlevel [2345]
stop on runlevel [!2345]

respawn

ray1729

(require '[clojure.java.io :as io])
(require '[oauth.twitter :refer [oauth-client]])

(defn read-properties
  "Parse a properties file, convert the property keys to Clojure
  keywords and return as a Clojure map."
  [resource-name]
  (when-let [resource (io/resource resource-name)]
    (let [properties (java.util.Properties.)]
      (with-open [stream (io/input-stream resource)]

ray1729

(defn expand-partition
  "Given a partition of size n and an element, generate n new
  partitions by adding `element` to each subset in turn."
  [partition element]
  (let [partition (vec partition)]
    (for [i (range (count partition))]
      (set (update-in partition [i] #(conj % element))))))

(defn partitions
  "Return all partitions of the set `X` into `n` non-empty subsets.

ray1729

(defn filter-file [filename]
  (with-open [rdr (io/reader filename)]
    (reduce (fn [words line]
              (into words (filter #(<= 4 (count %) 9) (str/split line #"\s+"))))
            #{}
            (line-seq rdr))))

ray1729

(ns parsatron-play.core
  (:refer-clojure :exclude [char])
  (:require [the.parsatron :refer :all]))

;; Goal is to parse something like:
;; ##INFO=<ID=foo,Type=Integer,Number=1,Description="Some description, which may contain commas">

(defparser not-char [& cs]
  (token (complement (set cs))))

ray1729

(fn solve-maze
  [maze]
  (let [num-rows (count maze)
        num-cols (count (first maze))
        char-at-pos (fn [[row col]] (get (get maze row) col))
        free? (fn [p] (when-let [c (char-at-pos p)] (not= c \#)))
        neighbours (fn [[row col]] (filter free? (map (fn [[delta-row delta-col]]
                                                       [(+ row delta-row)
                                                        (+ col delta-col)])
                                                     [[0 0] [0 1] [0 -1] [1 0] [-1 0]])))

ray1729

#!/usr/bin/env perl

use strict;
use warnings FATAL => 'all';

use List::Util qw(max min);

my @COLS     = qw( label _ chr strand start end );
my @KEY_COLS = qw( label chr strand );

ray1729

#!/usr/bin/env perl

use strict;
use warnings FATAL => 'all';

my %seen;
my @uniq;

while ( <> ) {
    chomp;

ray1729

(defn factorial [n] (reduce * (range 1 (inc n))))

(defn multinomial [n & ms]
  (/ (factorial n) (reduce * (map factorial ms))))

(def N (reduce +  (for [m1 (range 1 6)
                        m2 (range 1 (- 7 m1))
                        m3 (range 1 (- 8 m1 m2))
                        m4 (range 1 (- 9 m1 m2 m3))
                        m5 (range 1 (- 10 m1 m2 m3 m4))